Sciweavers

6368 search results - page 188 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
CGF
2008
148views more  CGF 2008»
15 years 6 months ago
Automatic Registration for Articulated Shapes
We present an unsupervised algorithm for aligning a pair of shapes in the presence of significant articulated motion and missing data, while assuming no knowledge of a template, u...
Will Chang, Matthias Zwicker
ICPR
2002
IEEE
15 years 11 months ago
Tangent Distance Kernels for Support Vector Machines
When dealing with pattern recognition problems one encounters different types of a-priori knowledge. It is important to incorporate such knowledge into the classification method ...
Bernard Haasdonk, Daniel Keysers
ISLPED
2004
ACM
153views Hardware» more  ISLPED 2004»
15 years 12 months ago
Any-time probabilistic switching model using bayesian networks
Modeling and estimation of switching activities remain to be important problems in low-power design and fault analysis. A probabilistic Bayesian Network based switching model can ...
Shiva Shankar Ramani, Sanjukta Bhanja
183
Voted
ICMCS
2008
IEEE
151views Multimedia» more  ICMCS 2008»
16 years 27 days ago
Fast keyword detection with sparse time-frequency models
We address the problem of keyword spotting in continuous speech streams when training and testing conditions can be different. We propose a keyword spotting algorithm based on spa...
Effrosini Kokiopoulou, Pascal Frossard, Olivier Ve...
EDBT
2008
ACM
120views Database» more  EDBT 2008»
16 years 6 months ago
Schema mapping verification: the spicy way
Schema mapping algorithms rely on value correspondences ? i.e., correspondences among semantically related attributes ? to produce complex transformations among data sources. Thes...
Angela Bonifati, Giansalvatore Mecca, Alessandro P...