Sciweavers

2740 search results - page 178 / 548
» Approximating Component Selection
Sort
View
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
13 years 5 months ago
The shifting sands algorithm
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
Andrew McGregor, Paul Valiant
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
15 years 9 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme
COCO
1995
Springer
113views Algorithms» more  COCO 1995»
15 years 6 months ago
On the Structure of Low Sets
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...
Johannes Köbler
ESANN
2006
15 years 4 months ago
Optimal design of hierarchical wavelet networks for time-series forecasting
The purpose of this study is to identify the Hierarchical Wavelet Neural Networks (HWNN) and select important input features for each sub-wavelet neural network automatically. Base...
Yuehui Chen, Bo Yang, Ajith Abraham
CVPR
2007
IEEE
16 years 5 months ago
Capturing People in Surveillance Video
This paper presents reliable techniques for detecting, tracking, and storing keyframes of people in surveillance video. The first component of our system is a novel face detector ...
Rogerio Feris, Ying-li Tian, Arun Hampapur