Sciweavers

4110 search results - page 397 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
155
Voted
ICMCS
2006
IEEE
90views Multimedia» more  ICMCS 2006»
16 years 25 days ago
Fast Video Object Selection for Interactive Television
In this paper, we study the problem of the fast selection of video objects, as an aid for the efficient semi-automatic annotation of video programs. In a regular system, the user ...
Rémi Trichet, Bernard Mérialdo
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 8 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
ICML
2006
IEEE
16 years 7 months ago
Learning low-rank kernel matrices
Kernel learning plays an important role in many machine learning tasks. However, algorithms for learning a kernel matrix often scale poorly, with running times that are cubic in t...
Brian Kulis, Inderjit S. Dhillon, Máty&aacu...
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
16 years 8 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller
SMI
1999
IEEE
116views Image Analysis» more  SMI 1999»
15 years 11 months ago
Intersecting Surfaces of Special Types
We present efficient and robust algorithms for intersecting a freeform surface with a ringed surface or a ruled surface. A ringed surface is given as a one-parameter family of cir...
Myung-Soo Kim