Sciweavers

5964 search results - page 870 / 1193
» A theory of speculative computation
Sort
View
ICDCS
2012
IEEE
13 years 9 months ago
DARD: Distributed Adaptive Routing for Datacenter Networks
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
Xin Wu, Xiaowei Yang
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
16 years 12 days ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
16 years 2 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
16 years 7 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
SIGGRAPH
2009
ACM
16 years 1 months ago
Spectral mesh processing
Spectral methods for mesh processing and analysis rely on the eigenvalues, eigenvectors, or eigenspace projections derived from appropriately defined mesh operators to carry out ...
Bruno Lévy, Hao Zhang 0002