Sciweavers

10633 search results - page 1896 / 2127
» Relating Distributed Objects
Sort
View
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
16 years 2 months ago
Assessment and pruning of hierarchical model based clustering
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
CHI
2006
ACM
16 years 2 months ago
Because I carry my cell phone anyway: functional location-based reminder applications
Although they have potential, to date location-based information systems have not radically improved the way we interact with our surroundings. To study related issues, we develop...
Pamela J. Ludford, Dan Frankowski, Ken Reily, Kurt...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 2 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
VLDB
2008
ACM
127views Database» more  VLDB 2008»
16 years 2 months ago
Delay aware querying with Seaweed
Large highly distributed data sets are poorly supported by current query technologies. Applications such as endsystembased network management are characterized by data stored on l...
Dushyanth Narayanan, Austin Donnelly, Richard Mort...
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
16 years 2 months ago
Paths to stardom: calibrating the potential of a peer-based data management system
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
Mihai Lupu, Beng Chin Ooi, Y. C. Tay
« Prev « First page 1896 / 2127 Last » Next »