Sciweavers

2754 search results - page 488 / 551
» Distributed Weighted Matching
Sort
View
SPAA
1995
ACM
15 years 7 months ago
Parallel Sorting with Limited Bandwidth
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
Micah Adler, John W. Byers, Richard M. Karp
136
Voted
DEBS
2008
ACM
15 years 5 months ago
Top-k/w publish/subscribe: finding k most relevant publications in sliding time window w
Existing content-based publish/subscribe systems are designed assuming that all matching publications are equally relevant to a subscription. As we cannot know in advance the dist...
Kresimir Pripuzic, Ivana Podnar Zarko, Karl Aberer
NIPS
2004
15 years 4 months ago
Constraining a Bayesian Model of Human Visual Speed Perception
It has been demonstrated that basic aspects of human visual motion perception are qualitatively consistent with a Bayesian estimation framework, where the prior probability distri...
Alan Stocker, Eero P. Simoncelli
IOPADS
1997
152views more  IOPADS 1997»
15 years 4 months ago
Competitive Parallel Disk Prefetching and Buffer Management
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 ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
HPDC
2010
IEEE
15 years 4 months ago
Reshaping text data for efficient processing on Amazon EC2
Text analysis tools are nowadays required to process increasingly large corpora which are often organized as small files (abstracts, news articles, etc). Cloud computing offers a ...
Gabriela Turcu, Ian T. Foster, Svetlozar Nestorov