Sciweavers

4816 search results - page 701 / 964
» Performance analysis of the AntNet algorithm
Sort
View
NIPS
2004
15 years 8 months ago
Euclidean Embedding of Co-Occurrence Data
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...
SODA
2004
ACM
131views Algorithms» more  SODA 2004»
15 years 8 months ago
When indexing equals compression: experiments with compressing suffix arrays and applications
We report on a new experimental analysis of high-order entropy-compressed suffix arrays, which retains the theoretical performance of previous work and represents an improvement in...
Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 6 months ago
New Criteria for Iterative Decoding
Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate...
Florence Alberge, Ziad Naja, Pierre Duhamel
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 6 months ago
Constraint solvers: An empirical evaluation of design decisions
This paper presents an evaluation of the design decisions made in four state-of-the-art constraint solvers; Choco, ECLiPSe, Gecode, and Minion. To assess the impact of design deci...
Lars Kotthoff
TASE
2008
IEEE
15 years 6 months ago
Perspectives in Probabilistic Verification
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...
Joost-Pieter Katoen