Sciweavers

356 search results - page 54 / 72
» Solving the Small Sample Size Problem of LDA
Sort
View
114
Voted
LATIN
1998
Springer
15 years 6 months ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro
166
Voted
TEI
2012
ACM
331views Hardware» more  TEI 2012»
13 years 9 months ago
Body-centric interaction with mobile devices
Most current mobile technologies require on-screen operations for interacting with devices’ visual contents. However, as a trade-off for mobility, screens usually provide limite...
Xiang 'Anthony' Chen
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
15 years 10 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young
111
Voted
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
15 years 3 months ago
Exploiting the path of least resistance in evolution
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...
Gearoid Murphy, Conor Ryan
JMLR
2006
92views more  JMLR 2006»
15 years 1 months ago
Linear Programs for Hypotheses Selection in Probabilistic Inference Models
We consider an optimization problem in probabilistic inference: Given n hypotheses Hj, m possible observations Ok, their conditional probabilities pk j, and a particular Ok, selec...
Anders Bergkvist, Peter Damaschke, Marcel Lüt...