Sciweavers

1418 search results - page 231 / 284
» A Theory of Stream Queries
Sort
View
ML
2007
ACM
108views Machine Learning» more  ML 2007»
13 years 8 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov
TALG
2010
110views more  TALG 2010»
13 years 7 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
13 years 6 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
PVLDB
2010
252views more  PVLDB 2010»
13 years 3 months ago
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, Ge Yu
CIKM
2011
Springer
12 years 9 months ago
Hybrid models for future event prediction
We present a hybrid method to turn off-the-shelf information retrieval (IR) systems into future event predictors. Given a query, a time series model is trained on the publication...
Giuseppe Amodeo, Roi Blanco, Ulf Brefeld