Sciweavers

9719 search results - page 146 / 1944
» Answer Set Optimization
Sort
View
92
Voted
NBIS
2007
Springer
15 years 7 months ago
A Ring Infrastructure for Neighbor-Centric Peer-to-Peer Applications
We propose a peer-to-peer system that supports distributed virtual world applications. For these applications, the connections between directly neighboring peers are of the utmost ...
Oliver Haase, Alfred Toth, Jürgen Wäsch
COMPGEOM
2006
ACM
15 years 6 months ago
The predicates for the Voronoi diagram of ellipses
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation para...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
122
Voted
AAAI
2007
15 years 3 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
161
Voted
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
14 years 4 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
96
Voted
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
16 years 1 months ago
Constructing non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky