Sciweavers

2446 search results - page 458 / 490
» Choiceless Polynomial Time
Sort
View
ECAI
2010
Springer
13 years 6 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
MM
1997
ACM
97views Multimedia» more  MM 1997»
13 years 11 months ago
A Failure and Overload Tolerance Mechanism for Continuous Media Servers
–Large scale clustered continuous media (CM) servers deployed in applications like video-on-demand have high availability requirements. In the event of server failure, streams fr...
Rajesh Krishnan, Dinesh Venkatesh, Thomas D. C. Li...
EDBT
2009
ACM
145views Database» more  EDBT 2009»
13 years 11 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...
CC
2008
Springer
133views System Software» more  CC 2008»
13 years 7 months ago
Hardness Amplification via Space-Efficient Direct Products
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Venkatesan Guruswami, Valentine Kabanets
INFFUS
2008
175views more  INFFUS 2008»
13 years 7 months ago
Adaptive optimization of join trees for multi-join queries over sensor streams
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...
Joseph S. Gomes, Hyeong-Ah Choi