Sciweavers

2520 search results - page 139 / 504
» The complexity of approximating entropy
Sort
View
PODS
2008
ACM
250views Database» more  PODS 2008»
15 years 10 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
MOBIHOC
2007
ACM
15 years 10 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
PODC
2005
ACM
15 years 4 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
WINE
2005
Springer
122views Economy» more  WINE 2005»
15 years 4 months ago
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
Ning Chen, Atri Rudra
GIS
1999
ACM
15 years 3 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas