Sciweavers

592 search results - page 55 / 119
» Indexing Factors with Gaps
Sort
View
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
14 years 2 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
14 years 1 hour 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
CIVR
2009
Springer
221views Image Analysis» more  CIVR 2009»
14 years 4 months ago
Movie segmentation into scenes and chapters using locally weighted bag of visual words
Movies segmentation into semantically correlated units is a quite tedious task due to ”semantic gap”. Low-level features do not provide useful information about the semantical...
Vasileios Chasanis, Argyris Kalogeratos, Aristidis...
ICPR
2010
IEEE
14 years 3 months ago
New Wavelet and Color Features for Text Detection in Video
Automatic text detection in video is an important task for efficient and accurate indexing and retrieval of multimedia data such as events identification, events boundary identific...
Shivakumara Palaiahnakote, Trung Quy Phan, Chew-Li...
WDAG
2004
Springer
98views Algorithms» more  WDAG 2004»
14 years 3 months ago
Dynamic Memory ABP Work-Stealing
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (hencheforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
Danny Hendler, Yossi Lev, Nir Shavit