736 search results - page 99 / 148 » Distinguishing geometric graphs |
154
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
220
click to vote
MST
2010
15 years 19 days ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
320
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
174
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Geometric rearrangement of images includes operations
such as image retargeting, inpainting, or object rearrangement.
Each such operation can be characterized by a shiftmap:
the...
147
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
The goal of this paper is to find sparse and representative spatial priors that can be applied to part-based object localization. Assuming a GMRF prior over part configurations, w...