Sciweavers

525 search results - page 89 / 105
» Bidimensionality and geometric graphs
Sort
View
DCOSS
2005
Springer
14 years 1 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
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 ...
Amitabha Ghosh, Sajal K. Das
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
14 years 24 days ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
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 ...
Shmuel Safra, Oded Schwartz
DATE
2002
IEEE
128views Hardware» more  DATE 2002»
14 years 16 days ago
Arbitrary Convex and Concave Rectilinear Module Packing Using TCG
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 ...
Jai-Ming Lin, Hsin-Lung Chen, Yao-Wen Chang
SCIA
2009
Springer
261views Image Analysis» more  SCIA 2009»
14 years 3 days ago
Dense and Deformable Motion Segmentation for Wide Baseline Images
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...
Juho Kannala, Esa Rahtu, Sami S. Brandt, Janne Hei...
ADBIS
2000
Springer
82views Database» more  ADBIS 2000»
13 years 12 months ago
A New Algorithm for Page Access Sequencing in Join Processing
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...
Andrew Lim, Wee-Chong Oon, Chi-Hung Chi