12264 search results - page 139 / 2453 » An Analysis of the XSL Algorithm |
149
Voted
ICIAP
2001
Springer
15 years 9 months ago
2001
Springer
Scene analysis is an important area of research with the aim of identifying objects and their relationships in natural scenes. MINERVA benchmark has been recently introduced in th...
105
click to vote
STACS
2010
Springer
15 years 12 months ago
2010
Springer
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...
136
Voted
ICALP
2000
Springer
15 years 8 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,...
117
Voted
CORR
2008
Springer
15 years 5 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...
148
Voted
LICS
2003
IEEE
15 years 10 months 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...