2924 search results - page 247 / 585 » Lower Bounds in Distributed Computing |
200
click to vote
IOPADS
1997
15 years 8 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
161
click to vote
IPPS
2005
IEEE
16 years 10 days ago
2005
IEEE
A new high performance computation technique involving multiple processors on a single silicon die is quickly gaining popularity. This new design approach provides very high perfo...
172
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
180
click to vote
ICALP
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
188
Voted
ICDE
2006
IEEE
16 years 23 days ago
2006
IEEE
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...