Sciweavers

1085 search results - page 195 / 217
» Hug over a distance
Sort
View
MICCAI
2005
Springer
14 years 10 months ago
Shape-Based Averaging for Combination of Multiple Segmentations
Combination of multiple segmentations has recently been introduced as an effective method to obtain segmentations that are more accurate than any of the individual input segmentati...
Torsten Rohlfing, Calvin R. Maurer Jr.
ICML
2005
IEEE
14 years 10 months ago
Combining model-based and instance-based learning for first order regression
T ORDER REGRESSION (EXTENDED ABSTRACT) Kurt Driessensa Saso Dzeroskib a Department of Computer Science, University of Waikato, Hamilton, New Zealand (kurtd@waikato.ac.nz) b Departm...
Kurt Driessens, Saso Dzeroski
WWW
2009
ACM
14 years 10 months ago
Extracting article text from the web with maximum subsequence segmentation
Much of the information on the Web is found in articles from online news outlets, magazines, encyclopedias, review collections, and other sources. However, extracting this content...
Jeff Pasternack, Dan Roth
STOC
2009
ACM
161views Algorithms» more  STOC 2009»
14 years 10 months ago
List decoding tensor products and interleaved codes
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
Parikshit Gopalan, Venkatesan Guruswami, Prasad Ra...
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 10 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan