Sciweavers

1612 search results - page 212 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
STOC
1997
ACM
111views Algorithms» more  STOC 1997»
15 years 6 months ago
The Swendsen-Wang Process Does Not Always Mix Rapidly
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
Vivek Gore, Mark Jerrum
GCB
1997
Springer
77views Biometrics» more  GCB 1997»
15 years 6 months ago
Statistics of large scale sequence searching
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
Rainer Spang, Martin Vingron
UAI
2008
15 years 3 months ago
Strategy Selection in Influence Diagrams using Imprecise Probabilities
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
Cassio Polpo de Campos, Qiang Ji
136
Voted
NIPS
2004
15 years 3 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, ...
115
Voted
EOR
2008
200views more  EOR 2008»
15 years 2 months ago
General variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...