Sciweavers

360 search results - page 48 / 72
» Dynamic Sample Selection for Approximate Query Processing
Sort
View
ICML
2008
IEEE
14 years 9 months ago
Reinforcement learning in the presence of rare events
We consider the task of reinforcement learning in an environment in which rare significant events occur independently of the actions selected by the controlling agent. If these ev...
Jordan Frank, Shie Mannor, Doina Precup
ICDAR
2011
IEEE
12 years 8 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
CCR
2008
101views more  CCR 2008»
13 years 8 months ago
Empirical evaluation of hash functions for multipoint measurements
A broad spectrum of network measurement applications demand passive multipoint measurements in which data from multiple observation points has to be correlated. Examples are the p...
Christian Henke, Carsten Schmoll, Tanja Zseby
VLDB
2004
ACM
104views Database» more  VLDB 2004»
14 years 1 months ago
Remembrance of Streams Past: Overload-Sensitive Management of Archived Streams
This paper studies Data Stream Management Systems that combine real-time data streams with historical data, and hence access incoming streams and archived data simultaneously. A s...
Sirish Chandrasekaran, Michael J. Franklin
ICML
2008
IEEE
14 years 9 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash