Sciweavers

594 search results - page 118 / 119
» A Note on Concepts and Distances
Sort
View
TIT
2002
126views more  TIT 2002»
14 years 11 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy
NN
2007
Springer
14 years 11 months ago
Perception through visuomotor anticipation in a mobile robot
Several scientists suggested that certain perceptual qualities are based on sensorimotor anticipation: for example, the softness of a sponge is perceived by anticipating the sensa...
Heiko Hoffmann
PR
2007
100views more  PR 2007»
14 years 11 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
CORR
2010
Springer
178views Education» more  CORR 2010»
14 years 10 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
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...
Daniel Dadush, Chris Peikert, Santosh Vempala
INFOCOM
2010
IEEE
14 years 10 months ago
Maximizing the Contact Opportunity for Vehicular Internet Access
Abstract—With increasing popularity of media enabled handhelds, the need for high data-rate services for mobile users is evident. Large-scale Wireless LANs (WLANs) can provide su...
Zizhan Zheng, Zhixue Lu, Prasun Sinha, Santosh Kum...