Sciweavers

628 search results - page 126 / 126
» Approximation Algorithms for Quickest Spanning Tree Problems
Sort
View
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
14 years 4 days ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
CVPR
2007
IEEE
14 years 7 months ago
Efficient MRF Deformation Model for Non-Rigid Image Matching
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
Alexander Shekhovtsov, Ivan Kovtun, Václav ...
ML
1998
ACM
131views Machine Learning» more  ML 1998»
13 years 5 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell