Sciweavers

620 search results - page 84 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 4 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
16 years 6 days ago
Spatial scan statistics: approximations and performance study
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
Deepak Agarwal, Andrew McGregor, Jeff M. Phillips,...
IROS
2007
IEEE
109views Robotics» more  IROS 2007»
15 years 6 months ago
A new approach to segmentation of 2D range scans into linear regions
— Toward obtaining a compact and multiresolution representation of 2D range scans, a wavelet framework is proposed for encoding an orientation measure called Running Angle (RA). ...
Ahad Harati, Roland Siegwart
UIST
2005
ACM
15 years 5 months ago
PlayAnywhere: a compact interactive tabletop projection-vision system
We introduce PlayAnywhere, a front-projected computer vision-based interactive table system which uses a new commercially available projection technology to obtain a compact, self...
Andrew D. Wilson
COLT
2005
Springer
15 years 5 months ago
Leaving the Span
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
Manfred K. Warmuth, S. V. N. Vishwanathan