Sciweavers

480 search results - page 27 / 96
» Algorithmic tests and randomness with respect to a class of ...
Sort
View
KDD
2004
ACM
195views Data Mining» more  KDD 2004»
14 years 8 months ago
Improved robustness of signature-based near-replica detection via lexicon randomization
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...
Aleksander Kolcz, Abdur Chowdhury, Joshua Alspecto...
CORR
2007
Springer
183views Education» more  CORR 2007»
13 years 7 months ago
Compressed Sensing and Redundant Dictionaries
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
Holger Rauhut, Karin Schnass, Pierre Vandergheynst
WCE
2007
13 years 8 months ago
On the Non-Gaussian Nature of Random Vehicle Vibrations
—This paper presents one of the outcomes of a research project concerned with the development of a method for synthesizing, under controlled conditions in the laboratory, the ran...
Vincent Rouillard
ICRA
2005
IEEE
103views Robotics» more  ICRA 2005»
14 years 1 months ago
Metric-Based Scan Matching Algorithms for Mobile Robot Displacement Estimation
— This paper presents a metric-based matching algorithm to estimate the robot planar displacement by matching dense two-dimensional range scans. The contribution is a geometric d...
Javier Minguez, Florent Lamiraux, Luis Montesano
COMBINATORICA
2007
119views more  COMBINATORICA 2007»
13 years 7 months ago
Complete partitions of graphs
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
Magnús M. Halldórsson, Guy Kortsarz,...