Sciweavers

6365 search results - page 103 / 1273
» Fast Local Computation Algorithms
Sort
View
ANCS
2009
ACM
15 years 12 days ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...
138
Voted
CPAIOR
2008
Springer
15 years 4 months ago
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gi...
167
Voted
AROBOTS
2006
95views more  AROBOTS 2006»
15 years 2 months ago
Treemap: An O(log n) algorithm for indoor simultaneous localization and mapping
This article presents a very efficient SLAM algorithm that works by hierarchically dividing a map into local regions and subregions. At each level of the hierarchy each region sto...
Udo Frese
145
Voted
ICCV
2009
IEEE
16 years 7 months ago
Detection of Human Actions From A Single Example
We present an algorithm for detecting human actions based upon a single given video example of such actions. The proposed method is unsupervised, does not require learning, segm...
Hae Jong Seo, Peyman Milanfar
SPATIALCOGNITION
2004
Springer
15 years 8 months ago
Treemap: An O(log n) Algorithm for Simultaneous Localization and Mapping
This paper presents a very efficient SLAM algorithm that works by hierarchically dividing the map into local regions and subregions. At each level of the hierarchy each region stor...
Udo Frese