Sciweavers

42 search results - page 1 / 9
» Computation of Highly Regular Nearby Points
Sort
View
ISTCS
1995
Springer
13 years 8 months ago
Computation of Highly Regular Nearby Points
We call a vector x 2 IRn highly regular if it satis es < x m >= 0 for some short, non{zero integer vector m where < : : > is the inner product. We present an algorithm...
Carsten Rössner, Claus-Peter Schnorr
CVPR
2007
IEEE
14 years 7 months ago
Regularized Mixed Dimensionality and Density Learning in Computer Vision
A framework for the regularized estimation of nonuniform dimensionality and density in high dimensional data is introduced in this work. This leads to learning stratifications, th...
Gloria Haro, Gregory Randall, Guillermo Sapiro
HUC
2005
Springer
13 years 10 months ago
Self-Mapping in 802.11 Location Systems
Location systems that are based on scanning for nearby radio sources can estimate the position of a mobile device with reasonable accuracy and high coverage. These systems require ...
Anthony LaMarca, Jeffrey Hightower, Ian E. Smith, ...
PARA
2000
Springer
13 years 8 months ago
JavaGrande - High Performance Computing with Java
The JavaGrande Forum is a group of users, researchers, and interested parties from industry. The Forum members are either trying to use Java for resource-intensive applications or ...
Michael Philippsen, Ronald F. Boisvert, Vladimir G...
CVPR
2006
IEEE
14 years 7 months ago
Dimensionality Reduction by Learning an Invariant Mapping
Dimensionality reduction involves mapping a set of high dimensional input points onto a low dimensional manifold so that "similar" points in input space are mapped to ne...
Raia Hadsell, Sumit Chopra, Yann LeCun