Sciweavers

6266 search results - page 44 / 1254
» New results on the computability and complexity of points - ...
Sort
View
ICB
2007
Springer
134views Biometrics» more  ICB 2007»
14 years 2 months ago
Singular Points Analysis in Fingerprints Based on Topological Structure and Orientation Field
Abstract. As an important feature of fingerprints, singular points (includingcores and deltas) not only represent the local ridge pattern characteristics, but also determine the to...
Jie Zhou, Jinwei Gu, David Zhang
AAAI
1997
13 years 10 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
TSP
2011
170views more  TSP 2011»
13 years 3 months ago
Model Selection for Sinusoids in Noise: Statistical Analysis and a New Penalty Term
—Detection of the number of sinusoids embedded in noise is a fundamental problem in statistical signal processing. Most parametric methods minimize the sum of a data fit (likeli...
Boaz Nadler, Leonid Kontorovich
ACL
2010
13 years 6 months ago
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
Sylvain Schmitz
LATIN
2010
Springer
14 years 13 days ago
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska