Sciweavers

1254 search results - page 170 / 251
» Making Hard Problems Harder
Sort
View
COMPGEOM
2010
ACM
14 years 2 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
KDD
2010
ACM
253views Data Mining» more  KDD 2010»
14 years 1 months ago
Mining periodic behaviors for moving objects
Periodicity is a frequently happening phenomenon for moving objects. Finding periodic behaviors is essential to understanding object movements. However, periodic behaviors could b...
Zhenhui Li, Bolin Ding, Jiawei Han, Roland Kays, P...
SIGIR
2010
ACM
14 years 1 months ago
Context-aware ranking in web search
The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused ...
Biao Xiang, Daxin Jiang, Jian Pei, Xiaohui Sun, En...
DATE
2009
IEEE
155views Hardware» more  DATE 2009»
14 years 1 months ago
Automatically mapping applications to a self-reconfiguring platform
The inherent reconfigurability of SRAM-based FPGAs enables the use of configurations optimized for the problem at hand. Optimized configurations are smaller and faster than their g...
Karel Bruneel, Fatma Abouelella, Dirk Stroobandt
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
14 years 1 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan