2498 search results - page 229 / 500 » Data Structures with Unpredictable Timing |
149
Voted
KDD
2012
ACM
13 years 5 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
120
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
109
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
115
Voted
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
114
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...