Sciweavers

359 search results - page 47 / 72
» Online Algorithms for Disk Graphs
Sort
View
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
15 years 12 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
CIDR
2003
164views Algorithms» more  CIDR 2003»
15 years 1 months ago
Capacity Bound-free Web Warehouse
Web cache technologies have been developed as an extension of CPU cache, by modifying LRU (Least Recently Used) algorithms. Actually in web cache systems, we can use disks and ter...
Yahiko Kambayashi, Kai Cheng
LATIN
2004
Springer
15 years 5 months ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
FOCS
2008
IEEE
15 years 6 months ago
Noise Tolerance of Expanders and Sublinear Expander Reconstruction
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
Satyen Kale, Yuval Peres, C. Seshadhri
SPIRE
2005
Springer
15 years 5 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez