Results 1  10
of
322
Convex Position Estimation in Wireless Sensor Networks
"... A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem fo ..."
Abstract

Cited by 493 (0 self)
 Add to MetaCart
A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem
MAPS: Multiresolution Adaptive Parameterization of Surfaces
, 1998
"... We construct smooth parameterizations of irregular connectivity triangulations of arbitrary genus 2manifolds. Our algorithm uses hierarchical simplification to efficiently induce a parameterization of the original mesh over a base domain consisting of a small number of triangles. This initial param ..."
Abstract

Cited by 265 (12 self)
 Add to MetaCart
We construct smooth parameterizations of irregular connectivity triangulations of arbitrary genus 2manifolds. Our algorithm uses hierarchical simplification to efficiently induce a parameterization of the original mesh over a base domain consisting of a small number of triangles. This initial
A Clustering Scheme for Hierarchical Control in Multihop Wireless Networks
, 2001
"... In this paper we present a clustering scheme to create a hierarchical control structure for multihop wireless networks. A cluster is defined as a subset of vertices, whose induced graph is connected. In addition, a cluster is required to obey certain constraints that are useful for management and s ..."
Abstract

Cited by 127 (0 self)
 Add to MetaCart
In this paper we present a clustering scheme to create a hierarchical control structure for multihop wireless networks. A cluster is defined as a subset of vertices, whose induced graph is connected. In addition, a cluster is required to obey certain constraints that are useful for management
Generation of Random Bayesian Networks with Constraints on Induced Width, with Application to the Average Analysis of dConnectivity, Quasirandom Sampling, and Loopy Propagation
 In Proceedings of the 16th Eureopean Conference on Artificial Intelligence
, 2004
"... We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The algorithms use ergodic Markov chains to generate samples, building upon previous algorithms by the authors. The introduction of constraints on induced width leads to more rea ..."
Abstract

Cited by 30 (2 self)
 Add to MetaCart
We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The algorithms use ergodic Markov chains to generate samples, building upon previous algorithms by the authors. The introduction of constraints on induced width leads to more
Probabilistic image segmentation with closedness constraints
 In ICCV
, 2011
"... We propose a novel graphical model for probabilistic image segmentation that contributes both to aspects of perceptual grouping in connection with image segmentation, and to globally optimal inference with higherorder graphical models. We represent image partitions in terms of cellular complexes in ..."
Abstract

Cited by 29 (14 self)
 Add to MetaCart
in order to make the duality between connected regions and their contours explicit. This allows us to formulate a graphical model with higherorder factors that represent the requirement that all contours must be closed. The model induces a probability measure on the space of all partitions, concentrated
Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem
 Artificial Intelligence
, 1996
"... Practical Constraint Satisfaction Problems (CSPs) such as design of integrated circuits or scheduling generally entail large search spaces with hundreds or even thousands of variables, each with hundreds or thousands of possible values. Often, only a very tiny fraction of all these possible assignme ..."
Abstract

Cited by 59 (3 self)
 Add to MetaCart
and value heuristics do not perform well in this domain. This is attributed to the difficulty of these heuristics to properly account for the tightness of constraints and/or the connectivity of the constraint graphs induced by job shop scheduling CSPs. A new probabilistic framework is introduced that better
Materials for an exploratory theory of the network society.
 The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, crosscultural investigation. It permeates most societies in the world, in v ..."
Abstract

Cited by 122 (0 self)
 Add to MetaCart
instrumental tool of management of new forms of life, including the building of online communities of support and collective learning. I see, however, a much stronger connection between networks and relationships of experience through the cultural transformations induced by communication networks
Using Blocks for Constraint Satisfaction
, 1998
"... The influence of graphrelated properties on constraint satisfaction problems (CSP) has been investigated thoroughly. In this paper, we analyze the impact of a further graph concept on CSPs: biconnected components (blocks). They are an important structure which we exploit for constraint satisfaction ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The influence of graphrelated properties on constraint satisfaction problems (CSP) has been investigated thoroughly. In this paper, we analyze the impact of a further graph concept on CSPs: biconnected components (blocks). They are an important structure which we exploit for constraint
Distributed Online Localization in Sensor Networks Using a Moving Target
 In Proceedings of the third international symposium on Information processing in sensor networks
, 2003
"... We describe a novel method for node localization in a sensor network where there are a fraction of reference nodes with known locations. For applicationspecific sensor networks, we argue that it makes sense to treat localization through online distributed learning and integrate it with an applic ..."
Abstract

Cited by 79 (0 self)
 Add to MetaCart
it with an application task such as target tracking. We propose distributed online algorithm in which sensor nodes use geometric constraints induced by both radio connectivity and sensing to decrease the uncertainty of their position. The sensing constraints, which are caused by a commonly sensed moving target
Network Construction with Subgraph Connectivity Constraints
"... Abstract. We consider the problem of building a network given connectivity constraints. A network designer is given a set of vertices V and constraints Si ⊆ V, and seeks to build the lowest cost set of edges E such that each Si induces a connected subgraph of (V, E). In the offline version of the pr ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We consider the problem of building a network given connectivity constraints. A network designer is given a set of vertices V and constraints Si ⊆ V, and seeks to build the lowest cost set of edges E such that each Si induces a connected subgraph of (V, E). In the offline version
Results 1  10
of
322