12264 search results - page 184 / 2453 » Analysis of the rubberband algorithm |
174
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
141
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...
197
click to vote
LICS
2003
IEEE
16 years 9 days ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
181
click to vote
CLUSTER
2009
IEEE
15 years 11 months ago
2009
IEEE
—Statistical analysis is widely used for countless scientific applications in order to analyze and infer meaning from data. A key challenge of any statistical analysis package a...
186
Voted
TALG
2010
15 years 5 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...