Sciweavers

225 search results - page 22 / 45
» Explicit Combinatorial Structures for Cooperative Distribute...
Sort
View
116
Voted
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 2 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
COMPGEOM
2003
ACM
15 years 7 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
IJHPCA
2007
114views more  IJHPCA 2007»
15 years 1 months ago
An Approach To Data Distributions in Chapel
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
R. E. Diaconescu, Hans P. Zima
GIS
2009
ACM
16 years 3 months ago
Efficient and Secure Distribution of Massive Geo-Spatial Data
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
Hao Yuan, Mikhail J. Atallah
114
Voted
P2P
2003
IEEE
15 years 7 months ago
A Transpositional Redundant Data Update Algorithm for Growing Server-Less Video Streaming Systems
Recently, a new server-less architecture is proposed for building low-cost yet scalable video streaming systems. In this architecture, video blocks are distributed among user host...
Tsz Kin Ho, Jack Y. B. Lee