Sciweavers

182 search results - page 15 / 37
» Approximate Colored Range Queries
Sort
View
OPODIS
2007
13 years 10 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...
COMPGEOM
2009
ACM
14 years 3 months ago
Computing hereditary convex structures
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
Bernard Chazelle, Wolfgang Mulzer
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
14 years 8 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis
CCR
2006
117views more  CCR 2006»
13 years 8 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
ICDE
2004
IEEE
140views Database» more  ICDE 2004»
14 years 9 months ago
Approximate Aggregation Techniques for Sensor Databases
In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collec...
Jeffrey Considine, Feifei Li, George Kollios, John...