359 search results - page 2 / 72 » Solving Geometric Covering Problems by Data Reduction |
ECCV
2006
Springer
14 years 6 months ago
2006
Springer
In recent years, nonlinear dimensionality reduction (NLDR) techniques have attracted much attention in visual perception and many other areas of science. We propose an efficient al...
AHSWN
2006
13 years 4 months ago
2006
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
: In this paper I present several novel, efficient, algorithmic techniques for solving some multidimensional geometric data management and analysis problems. The techniques are bas...
TIT
2008
13 years 4 months ago
2008
We consider the problem of transmitting data at rate over a state-dependent channel with state information available at the sender and at the same time conveying the information ab...