736 search results - page 128 / 148 » Distinguishing geometric graphs |
DCOSS
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
ESA
2003
Springer
14 years 19 days ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
DATE
2002
IEEE
14 years 11 days ago
2002
IEEE
In this paper, we deal with arbitrary convex and concave rectilinear module packing using the Transitive Closure Graph (TCG) representation. The geometric meanings of modules are ...
SCIA
2009
Springer
13 years 12 months ago
2009
Springer
In this paper we describe a dense motion segmentation method for wide baseline image pairs. Unlike many previous methods our approach is able to deal with deforming motions and lar...
ADBIS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...