Sciweavers

4860 search results - page 70 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
COCO
2006
Springer
113views Algorithms» more  COCO 2006»
13 years 11 months ago
On the Complexity of Numerical Analysis
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
Eric Allender, Peter Bürgisser, Johan Kjeldga...
UAI
2000
13 years 9 months ago
The Complexity of Decentralized Control of Markov Decision Processes
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
Daniel S. Bernstein, Shlomo Zilberstein, Neil Imme...
COCO
2001
Springer
154views Algorithms» more  COCO 2001»
14 years 5 days ago
Quantum Algorithms for Element Distinctness
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
Harry Buhrman, Christoph Dürr, Mark Heiligman...
CPHYSICS
2011
267views Education» more  CPHYSICS 2011»
12 years 11 months ago
Fast alignment of a complex tracking detector using advanced track models
The inner silicon detector of the Compact Muon Solenoid experiment (CMS) at CERN’s LHC consists of 16 588 modules. Charged-particle tracks in the detector are used to improve th...
Volker Blobel, Claus Kleinwort, Frank Meier
WABI
2004
Springer
14 years 1 months ago
The Minisatellite Transformation Problem Revisited: A Run Length Encoded Approach
Abstract. In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n 3 + m 3 + mn 2 + nm 2 + mn) where n and m are the lengths of...
Behshad Behzadi, Jean-Marc Steyaert