Sciweavers

937 search results - page 175 / 188
» On the Complexity of Partial Order Properties
Sort
View
DIMACS
1996
14 years 11 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
15 years 10 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...
SI3D
2010
ACM
15 years 4 months ago
Fast capacity constrained Voronoi tessellation
Lloyd relaxation is widely employed to generate point distribution for a variety of applications in computer graphics, computer vision, and image processing. However, Lloyd relaxa...
Hongwei Li, Diego Nehab, Li-Yi Weiy, Pedro V. Sand...
SSD
2007
Springer
146views Database» more  SSD 2007»
15 years 4 months ago
Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy
In this paper we propose a fundamental approach to perform the class of Nearest Neighbor (NN) queries, the core class of queries used in many of the location-based services, withou...
Ali Khoshgozaran, Cyrus Shahabi
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 3 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust