Sciweavers

1051 search results - page 69 / 211
» On the Correspondence between Approximations and Similarity
Sort
View
JDA
2007
73views more  JDA 2007»
15 years 6 months ago
Parameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
Alberto Apostolico, Péter L. Erdös, Mo...
ECCV
2010
Springer
15 years 4 months ago
Articulation-Invariant Representation of Non-planar Shapes
Given a set of points corresponding to a 2D projection of a non-planar shape, we would like to obtain a representation invariant to articulations (under no self-occlusions). It is ...
Raghuraman Gopalan, Pavan K. Turaga, Rama Chellapp...
CVPR
2011
IEEE
15 years 2 months ago
Learning Message-Passing Inference Machines for Structured Prediction
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
Stephane Ross, Daniel Munoz, J. Andrew Bagnell
ECAI
2008
Springer
15 years 8 months ago
Towards Efficient Belief Update for Planning-Based Web Service Composition
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
Jörg Hoffmann
ADCM
1998
94views more  ADCM 1998»
15 years 6 months ago
On a vector q-d algorithm
Using the framework provided by Clifford algebras, we consider a noncommutative quotient-difference algorithm for obtaining the elements of a continued fraction corresponding to...
D. E. Roberts