Sciweavers

1819 search results - page 33 / 364
» Computability and Representations of the Zero Set
Sort
View
ICPR
2008
IEEE
15 years 11 months ago
Fingerprint indexing based on composite set of reduced SIFT features
Most of current fingerprint indexing schemes utilize features based on global textures and minutiae structures. To extend the existing technology of feature extraction, this paper...
Xin Shuai, Chao Zhang, Pengwei Hao
DAGSTUHL
2006
14 years 11 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
ISIPTA
1999
IEEE
15 years 1 months ago
Nonlinear Filtering of Convex Sets of Probability Distributions
A solution is provided to the problem of computing a convex set of conditional probability distributions that characterize the state of a nonlinear dynamic system as it evolves in...
John Kenney, Wynn C. Stirling
AAAI
2008
15 years 6 hour ago
What Is Answer Set Programming?
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in k...
Vladimir Lifschitz
81
Voted
ECAI
2008
Springer
14 years 11 months ago
Advanced Preprocessing for Answer Set Solving
Abstract. We introduce the first substantial approach to preprocessing in the context of answer set solving. The idea is to simplify a logic program while identifying equivalences ...
Martin Gebser, Benjamin Kaufmann, André Neu...