Sciweavers

1068 search results - page 138 / 214
» On Space Bounded Server Algorithms
Sort
View
ICML
1996
IEEE
14 years 8 months ago
Searching for Structure in Multiple Streams of Data
Finding structure in multiple streams of data is an important problem. Consider the streams of data owing from a robot's sensors, the monitors in an intensive care unit, or p...
Tim Oates, Paul R. Cohen
GIS
2004
ACM
14 years 9 months ago
A serverless 3D world
Online multi-participant virtual-world systems have attracted significant interest from the Internet community but are hindered by their inability to efficiently support interacti...
Egemen Tanin, Aaron Harwood, Hanan Samet, Sarana N...
COMPGEOM
2010
ACM
13 years 12 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 10 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
EDBT
2004
ACM
192views Database» more  EDBT 2004»
14 years 8 months ago
LIMBO: Scalable Clustering of Categorical Data
Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, ...
Periklis Andritsos, Panayiotis Tsaparas, Ren&eacut...