Sciweavers

5170 search results - page 284 / 1034
» Consistency of the FastSLAM Algorithm
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 2 months ago
The Power of Simple Tabulation Hashing
Randomized algorithms are often enjoyed for their simplicity, but the hash functions used to yield the desired theoretical guarantees are often neither simple nor practical. Here ...
Mihai Patrascu, Mikkel Thorup
CORR
2008
Springer
102views Education» more  CORR 2008»
15 years 2 months ago
On some deterministic dictionaries supporting sparsity
We describe a new construction of an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of finite groups...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
ENDM
2010
127views more  ENDM 2010»
15 years 2 months ago
MPQ-trees for orthogonal packing problem
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
Cédric Joncour, Arnaud Pêcher, Petru ...
IPL
2008
78views more  IPL 2008»
15 years 1 months ago
An approximation ratio for biclustering
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters ...
Kai Puolamäki, Sami Hanhijärvi, Gemma C....
JDWM
2006
84views more  JDWM 2006»
15 years 1 months ago
Discovering Surprising Instances of Simpson's Paradox in Hierarchical Multidimensional Data
This paper focuses on the discovery of surprising, unexpected patterns, based on a data mining method that consists of detecting instances of Simpson's paradox. By its very n...
Carem C. Fabris, Alex Alves Freitas