Sciweavers

4112 search results - page 194 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
CVPR
2009
IEEE
1468views Computer Vision» more  CVPR 2009»
17 years 2 months ago
Hardware-Efficient Belief Propagation
Belief propagation (BP) is an effective algorithm for solving energy minimization problems in computer vision. However, it requires enormous memory, bandwidth, and computation beca...
Chao-Chung Cheng, Chia-Kai Liang, Homer H. Chen, L...
RECOMB
2006
Springer
16 years 6 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 10 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
16 years 7 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
15 years 10 months ago
A computational efficient covariance matrix update and a (1+1)-CMA for evolution strategies
First, the covariance matrix adaptation (CMA) with rankone update is introduced into the (1+1)-evolution strategy. An improved implementation of the 1/5-th success rule is propose...
Christian Igel, Thorsten Suttorp, Nikolaus Hansen