Sciweavers

16404 search results - page 747 / 3281
» A set coverage problem
Sort
View
JMLR
2010
115views more  JMLR 2010»
15 years 2 months ago
Fast and Scalable Local Kernel Machines
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
Nicola Segata, Enrico Blanzieri
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
13 years 10 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
CVPR
2007
IEEE
16 years 9 months ago
Progressive Finite Newton Approach To Real-time Nonrigid Surface Detection
Detecting nonrigid surfaces is an interesting research problem for computer vision and image analysis. One important challenge of nonrigid surface detection is how to register a n...
Jianke Zhu, Michael R. Lyu
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
16 years 8 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
VLDB
2001
ACM
168views Database» more  VLDB 2001»
16 years 7 months ago
Answering queries using views: A survey
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessin...
Alon Y. Halevy