Sciweavers

1456 search results - page 26 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
EDBT
2010
ACM
132views Database» more  EDBT 2010»
15 years 1 months ago
Turbo-charging hidden database samplers with overflowing queries and skew reduction
Recently, there has been growing interest in random sampling from online hidden databases. These databases reside behind form-like web interfaces which allow users to execute sear...
Arjun Dasgupta, Nan Zhang 0004, Gautam Das
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
15 years 11 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
MLMI
2005
Springer
15 years 3 months ago
Improving the Performance of Acoustic Event Classification by Selecting and Combining Information Sources Using the Fuzzy Integr
Acoustic events produced in meeting-room-like environments may carry information useful for perceptually aware interfaces. In this paper, we focus on the problem of combining diffe...
Andrey Temko, Dusan Macho, Climent Nadeu
EURODAC
1995
IEEE
112views VHDL» more  EURODAC 1995»
15 years 1 months ago
On implementation choices for iterative improvement partitioning algorithms
Iterative improvement partitioning algorithms such as the FM algorithm of Fiduccia and Mattheyses 8 , the algorithm of Krishnamurthy 13 , and Sanchis's extensions of these al...
Lars W. Hagen, Dennis J.-H. Huang, Andrew B. Kahng
CORR
2010
Springer
174views Education» more  CORR 2010»
14 years 10 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor