505 search results - page 32 / 101 » On the Minimality and Decomposability of Constraint Networks |
TMC
2010
13 years 3 months ago
2010
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
GD
2009
Springer
13 years 11 months ago
2009
Springer
We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to concentric circles centered at the origin. Such constraints are typical, e.g., i...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
ICIP
2007
IEEE
14 years 2 months ago
2007
IEEE
Markov networks are an effective tool for the difficult but important problem of recognizing people in consumer image collections. Given a small set of labeled faces, we seek to ...
HUC
2003
Springer
14 years 1 months ago
2003
Springer
Ubicomp environments impose tough constraints on networks, including immediate communication, low energy consumption, minimal maintenance and administration. With the AwareCon netw...