2107 search results - page 345 / 422 » Computing Small Search Numbers in Linear Time |
135
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
133
Voted
WCNC
2008
IEEE
15 years 9 months ago
2008
IEEE
—Iterative K-best sphere detection (SD) and channel decoding is appealing, since it is capable of achieving a nearmaximum-a-posteriori (MAP) performance at a low complexity. Howe...
133
Voted
KDD
2008
ACM
16 years 3 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
118
click to vote
SAC
2005
ACM
15 years 8 months ago
2005
ACM
Video and image datasets can often be described by a small number of parameters, even though each image usually consists of hundreds or thousands of pixels. This observation is of...
121
Voted
SIGGRAPH
2010
ACM
15 years 6 months ago
2010
ACM
Manifold bootstrapping is a new method for data-driven modeling of real-world, spatially-varying reflectance, based on the idea that reflectance over a given material sample forms...