Sciweavers

334 search results - page 19 / 67
» Improved Algorithms and Complexity Results for Power Dominat...
Sort
View
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 7 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
PODC
2005
ACM
14 years 28 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ICRA
2006
IEEE
120views Robotics» more  ICRA 2006»
14 years 1 months ago
Distributed Diagnosis of Coupled Mobile Robots
— Fault diagnosis of coupled mobile robots requires a large number of measurements to be communicated either between the robots or from the robots to a central diagnoser. As comp...
Matthew J. Daigle, Xenofon D. Koutsoukos, Gautam B...
AAAI
2006
13 years 8 months ago
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
AINA
2007
IEEE
14 years 1 months ago
Heuristics for Improving Cryptographic Key Assignment in a Hierarchy
In hierarchical distributed systems, shared data access can be controlled by assigning user groups single cryptographic keys that allow high level users derive low level keys, but...
Anne V. D. M. Kayem, Patrick Martin, Selim G. Akl