736 search results - page 48 / 148 » Distinguishing geometric graphs |
PODC
2003
ACM
15 years 5 months ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
137
click to vote
TASE
2010
IEEE
14 years 6 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
118
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
MOBICOM
2005
ACM
15 years 5 months ago
2005
ACM
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
CVGIP
2007
14 years 11 months ago
2007
Point-based surface processing has developed into an attractive alternative to mesh-based processing techniques for a number of geometric modeling applications. By working with po...