Sciweavers

2464 search results - page 398 / 493
» Efficient learning equilibrium
Sort
View
ICML
2006
IEEE
14 years 11 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
ICML
2006
IEEE
14 years 11 months ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth
WWW
2008
ACM
14 years 11 months ago
Towards a global schema for web entities
Popular entities often have thousands of instances on the Web. In this paper, we focus on the case where they are presented in table-like format, namely appearing with their attri...
Conglei Yao, Yongjian Yu, Sicong Shou, Xiaoming Li
WWW
2005
ACM
14 years 11 months ago
Browsing fatigue in handhelds: semantic bookmarking spells relief
Focused Web browsing activities such as periodically looking up headline news, weather reports, etc., which require only selective fragments of particular Web pages, can be made m...
Saikat Mukherjee, I. V. Ramakrishnan
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 10 months ago
De-duping URLs via rewrite rules
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
Anirban Dasgupta, Ravi Kumar, Amit Sasturkar