Sciweavers

373 search results - page 56 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
JCSS
2010
190views more  JCSS 2010»
13 years 6 months ago
Pattern matching with don't cares and few errors
We present solutions for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols and a bound k...
Raphaël Clifford, Klim Efremenko, Ely Porat, ...
AUSAI
2010
Springer
13 years 5 months ago
A Heuristic on Effective and Efficient Clustering on Uncertain Objects
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
Edward Hung, Lei Xu, Chi-Cheong Szeto
CVPR
2008
IEEE
14 years 10 months ago
Auto-context and its application to high-level vision tasks
The notion of using context information for solving highlevel vision problems has been increasingly realized in the field. However, how to learn an effective and efficient context...
Zhuowen Tu
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
14 years 8 months ago
Turning down the noise in the blogosphere
In recent years, the blogosphere has experienced a substantial increase in the number of posts published daily, forcing users to cope with information overload. The task of guidin...
Khalid El-Arini, Gaurav Veda, Dafna Shahaf, Carlos...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 2 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith