Sciweavers

2767 search results - page 56 / 554
» Universal Exponentiation Algorithm
Sort
View
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
15 years 2 months ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...
IJCAI
2007
14 years 11 months ago
A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
Janusz Marecki, Sven Koenig, Milind Tambe
EUROPAR
2004
Springer
15 years 3 months ago
Improving the Scalability of Logarithmic-Degree DHT-Based Peer-to-Peer Networks
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...
Bruno Carton, Valentin Mesaros
ACL
1997
14 years 11 months ago
A Model of Lexical Attraction and Repulsion
This paper introduces new methods based on exponential families for modeling the correlations between words in text and speech. While previous work assumed the effects of word co-...
Doug Beeferman, Adam L. Berger, John D. Lafferty
CORR
2011
Springer
193views Education» more  CORR 2011»
14 years 1 months ago
The Rate of Convergence of AdaBoost
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
Indraneel Mukherjee, Cynthia Rudin, Robert E. Scha...