Sciweavers

33 search results - page 5 / 7
» Approximating Latin Square Extensions
Sort
View
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 3 months ago
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
Yaniv Plan, Roman Vershynin
INFOCOM
2006
IEEE
14 years 1 months ago
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
Abhishek Kashyap, Samir Khuller, Mark A. Shayman
TKDE
2008
162views more  TKDE 2008»
13 years 7 months ago
Continuous k-Means Monitoring over Moving Objects
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...
JMIV
2007
158views more  JMIV 2007»
13 years 7 months ago
On the Consistency of the Normalized Eight-Point Algorithm
A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data [IEEE Trans. Pattern Anal. Mach. Intell., 25(9...
Wojciech Chojnacki, Michael J. Brooks
ICIAP
2007
ACM
14 years 7 months ago
A Consistency Result for the Normalized Eight-Point Algorithm
A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data [IEEE Trans. Pattern Anal. Mach. Intell., 25(...
Wojciech Chojnacki, Michael J. Brooks