Sciweavers

4110 search results - page 173 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
COLT
2006
Springer
15 years 10 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
ICIP
2000
IEEE
16 years 8 months ago
Efficiently Estimating Projective Transformations
Projective transformations relate the coordinates of images that are taken by either a camera that undergoes only rotation while imaging an arbitrary scene, or one that rotates an...
Richard J. Radke, Peter J. Ramadge, Tomio Echigo, ...
JAL
2006
101views more  JAL 2006»
15 years 6 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
ICML
2007
IEEE
16 years 7 months ago
More efficiency in multiple kernel learning
An efficient and general multiple kernel learning (MKL) algorithm has been recently proposed by Sonnenburg et al. (2006). This approach has opened new perspectives since it makes ...
Alain Rakotomamonjy, Francis Bach, Stéphane...
EDBT
2009
ACM
145views Database» more  EDBT 2009»
15 years 10 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...