3016 search results - page 429 / 604 » A Granular Approach to Web Search Result Presentation |
195
click to vote
ICDE
2004
IEEE
16 years 3 months ago
2004
IEEE
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
ICPR
2006
IEEE
16 years 2 months ago
2006
IEEE
This paper presents a novel technique to fill in missing background and moving foreground of a video captured by a static or moving camera. Different from previous efforts which a...
148
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
135
click to vote
IROS
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— We consider the problem of Decentralized Simultaneous Localization And Mapping (DSLAM) for pedestrians in the context of Urban Search And Rescue (USAR). In this context...
131
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...