Sciweavers

12519 search results - page 121 / 2504
» Approximation Problems Categories
Sort
View
IPL
2007
81views more  IPL 2007»
15 years 6 months ago
Linear-time algorithms for problems on planar graphs with fixed disk dimension
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
Faisal N. Abu-Khzam, Michael A. Langston
SYNTHESE
2010
60views more  SYNTHESE 2010»
15 years 4 months ago
Darwin's solution to the species problem
: Biologists and philosophers that debate the existence of the species category are split into two main camps. Some believe that the species category does not exist and that the te...
Marc Ereshefsky
PODS
2012
ACM
276views Database» more  PODS 2012»
13 years 8 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
ISSTA
2006
ACM
16 years 9 days ago
Subdomain testing of units and systems with state
This paper extends basic software-testing theory to software components and adds explicit state to the theory. The resulting theory e enough to abstractly model the construction o...
Dick Hamlet
MOBIHOC
2006
ACM
16 years 6 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano