Sciweavers

2925 search results - page 160 / 585
» Information Complexity of Online Problems
Sort
View
ICDM
2008
IEEE
143views Data Mining» more  ICDM 2008»
16 years 28 days ago
Exploiting Data Semantics to Discover, Extract, and Model Web Sources
We describe DEIMOS, a system that automatically discovers and models new sources of information. The system exploits four core technologies developed by our group that makes an en...
José Luis Ambite, Craig A. Knoblock, Kristi...
JDA
2011
90views more  JDA 2011»
15 years 1 months ago
Pattern matching in pseudo real-time
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
Raphaël Clifford, Benjamin Sach
CIA
2004
Springer
15 years 12 months ago
A Probabilistic Approach to Predict Peers? Performance in P2P Networks
The problem of encouraging trustworthy behavior in P2P online communities by managing peers’ reputations has drawn a lot of attention recently. However, most of the proposed solu...
Zoran Despotovic, Karl Aberer
SOCIALCOM
2010
15 years 4 months ago
Friendfeed Breaking News: Death of a Public Figure
Abstract--Microblogging sites allow users to post short messages online, offering a reliable way to communicate and to spread information quickly and efficiently; moreover, they ca...
Matteo Magnani, Danilo Montesi, Luca Rossi
ICML
2010
IEEE
15 years 7 months ago
Metric Learning to Rank
We study metric learning as a problem of information retrieval. We present a general metric learning algorithm, based on the structural SVM framework, to learn a metric such that ...
Brian McFee, Gert R. G. Lanckriet