Sciweavers

CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 9 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
DAM
2010
81views more  DAM 2010»
13 years 9 months ago
The k-in-a-tree problem for graphs of girth at least k
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
W. Liu, Nicolas Trotignon
DAM
2010
60views more  DAM 2010»
13 years 9 months ago
One-to-many node-disjoint paths in (n, k)-star graphs
We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph Sn,k, where all nodes are distinct, builds a collection of n - 1 node-di...
Yonghong Xiang, Iain A. Stewart
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 9 months ago
A new distance for high level RNA secondary structure comparison
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the t...
Julien Allali, Marie-France Sagot
CORR
2008
Springer
142views Education» more  CORR 2008»
13 years 9 months ago
A Gaussian Belief Propagation Solver for Large Scale Support Vector Machines
Support vector machines (SVMs) are an extremely successful type of classification and regression algorithms. Building an SVM entails solving a constrained convex quadratic program...
Danny Bickson, Elad Yom-Tov, Danny Dolev
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 9 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 9 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
CORR
2008
Springer
179views Education» more  CORR 2008»
13 years 9 months ago
Distributed Parameter Estimation in Sensor Networks: Nonlinear Observation Models and Imperfect Communication
The paper studies the problem of distributed static parameter (vector) estimation in sensor networks with nonlinear observation models and imperfect inter-sensor communication. We...
Soummya Kar, José M. F. Moura, Kavita Raman...
CPHYSICS
2010
135views more  CPHYSICS 2010»
13 years 9 months ago
An events based algorithm for distributing concurrent tasks on multi-core architectures
In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application...
David W. Holmes, John R. Williams, Peter Tilke
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 9 months ago
Tight Bounds for Mixing of the Swendsen-Wang Algorithm at the Potts Transition Point
We study two widely used algorithms for the Potts model on rectangular subsets of the hypercubic lattice Zd
Christian Borgs, Jennifer T. Chayes, Prasad Tetali