Sciweavers

1403 search results - page 81 / 281
» Set cover algorithms for very large datasets
Sort
View
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
15 years 10 months ago
Semi-supervised time series classification
The problem of time series classification has attracted great interest in the last decade. However current research assumes the existence of large amounts of labeled training data...
Li Wei, Eamonn J. Keogh
JAIR
2010
130views more  JAIR 2010»
14 years 4 months ago
Interactive Cost Configuration Over Decision Diagrams
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
Henrik Reif Andersen, Tarik Hadzic, David Pisinger
CVPR
2012
IEEE
13 years 7 days ago
Learning latent temporal structure for complex event detection
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
Kevin Tang, Fei-Fei Li, Daphne Koller
PVLDB
2008
138views more  PVLDB 2008»
14 years 9 months ago
A skip-list approach for efficiently processing forecasting queries
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support pred...
Tingjian Ge, Stanley B. Zdonik
SOFSEM
2009
Springer
15 years 6 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach