166 search results - page 16 / 34 » Complexity of Some Geometric and Topological Problems |
VLSI
2005
Springer
14 years 2 months ago
2005
Springer
This work addresses the problem of application mapping in networks-on-chip (NoCs) having as goal to minimize the total dynamic energy consumption of a complex system-on-a-chip (So...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
ICPR
2000
IEEE
14 years 1 months ago
2000
IEEE
In this paper, we propose a new self-calibration technique for cameras with changing zoom observing only a planar structure. The method does not need any metric or topologic knowl...
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
MOBIHOC
2010
ACM
13 years 6 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...