Sciweavers

7930 search results - page 1506 / 1586
» Greedy in Approximation Algorithms
Sort
View
121
Voted
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
16 years 1 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
128
Voted
ICDT
2010
ACM
219views Database» more  ICDT 2010»
16 years 1 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
127
Voted
SDM
2009
SIAM
119views Data Mining» more  SDM 2009»
16 years 26 days ago
Twin Vector Machines for Online Learning on a Budget.
This paper proposes Twin Vector Machine (TVM), a constant space and sublinear time Support Vector Machine (SVM) algorithm for online learning. TVM achieves its favorable scaling b...
Zhuang Wang, Slobodan Vucetic
141
Voted
CVPR
2010
IEEE
16 years 3 days ago
Scalable Active Matching
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...
Ankur Handa, Margarita Chli, Hauke Strasdat, Andre...
121
Voted
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
15 years 10 months 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
« Prev « First page 1506 / 1586 Last » Next »