Sciweavers

2287 search results - page 209 / 458
» Making it Real
Sort
View
103
Voted
CVPR
2008
IEEE
16 years 4 months ago
A polynomial-time bound for matching and registration with outliers
We present a framework for computing optimal transformations, aligning one point set to another, in the presence of outliers. Example applications include shape matching and regis...
Carl Olsson, Olof Enqvist, Fredrik Kahl
ICML
2006
IEEE
16 years 3 months ago
Iterative RELIEF for feature weighting
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
Yijun Sun, Jian Li
KDD
2009
ACM
207views Data Mining» more  KDD 2009»
16 years 3 months ago
DynaMMo: mining and summarization of coevolving sequences with missing values
Given multiple time sequences with missing values, we propose DynaMMo which summarizes, compresses, and finds latent variables. The idea is to discover hidden variables and learn ...
Lei Li, James McCann, Nancy S. Pollard, Christos F...
GLOBECOM
2009
IEEE
15 years 9 months ago
A Logic Distance-Based Method for Deploying Probing Sources in the Topology Discovery
Abstract—Internet topology plays a vital role in studying network’s internal structure and properties. Currently traceroutebased topology discovery is the main approach to map ...
Xin Zou, Zhongliang Qiao, Gang Zhou, Ke Xu
128
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu