Sciweavers

538 search results - page 50 / 108
» Applying Interchangeability Techniques to the Distributed Br...
Sort
View
FOCS
2002
IEEE
15 years 8 months ago
Learning Intersections and Thresholds of Halfspaces
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
PODC
2010
ACM
15 years 7 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
120
Voted
TREC
2003
15 years 4 months ago
UMBC at TREC 12
Abstract. We present the results of UMBC’s participation in the Web and Novelty tracks. We explored various heuristics-based link analysis approaches to the Topic Distillation ta...
Srikanth Kallurkar, Yongmei Shi, R. Scott Cost, Ch...
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 8 months ago
Real-coded crossover as a role of kernel density estimation
This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which d...
Jun Sakuma, Shigenobu Kobayashi
209
Voted
VLDB
2007
ACM
129views Database» more  VLDB 2007»
16 years 3 months ago
Efficient Skyline Computation over Low-Cardinality Domains
Current skyline evaluation techniques follow a common paradigm that eliminates data elements from skyline consideration by finding other elements in the dataset that dominate them...
Michael D. Morse, Jignesh M. Patel, H. V. Jagadish