Sciweavers

224 search results - page 20 / 45
» The Complexity of Phrase Alignment Problems
Sort
View
ICASSP
2010
IEEE
15 years 23 days ago
Shape matching based on graph alignment using hidden Markov models
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
Xiaoning Qian, Byung-Jun Yoon
88
Voted
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 16 days ago
Graph Annotations in Modeling Complex Network Topologies
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, A...
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 4 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
86
Voted
CEC
2008
IEEE
15 years 7 months ago
On the evolution of laser pulses under a dynamic Quantum Control environment
Abstract— This paper introduces the optimization of a Quantum Control application, the so-called molecular alignment problem, subject to a dynamic environment. Given the relative...
Ofer M. Shir, Thomas Bäck, Herschel Rabitz, M...
124
Voted
LICS
2006
IEEE
15 years 6 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson