Sciweavers

373 search results - page 20 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
FP
1989
124views Formal Methods» more  FP 1989»
14 years 3 days ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones
SIGMOD
2006
ACM
114views Database» more  SIGMOD 2006»
14 years 8 months ago
Ordering the attributes of query results
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
Gautam Das, Vagelis Hristidis, Nishant Kapoor, S. ...
ALGORITHMICA
2010
107views more  ALGORITHMICA 2010»
13 years 8 months ago
A Universal Online Caching Algorithm Based on Pattern Matching
We present a universal algorithm for the classical online problem of caching or demand paging. We consider the caching problem when the page request sequence is drawn from an unkn...
Gopal Pandurangan, Wojciech Szpankowski
JMLR
2010
118views more  JMLR 2010»
13 years 2 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
DAGSTUHL
2007
13 years 9 months ago
Convergence of iterative aggregation/disaggregation methods based on splittings with cyclic iteration matrices
Iterative aggregation/disaggregation methods (IAD) belong to competitive tools for computation the characteristics of Markov chains as shown in some publications devoted to testing...
Ivo Marek, Ivana Pultarová, Petr Mayer