Sciweavers

7006 search results - page 240 / 1402
» Approximation Algorithms
Sort
View
178
Voted
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
15 years 4 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
CVPR
1997
IEEE
16 years 5 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
148
Voted
INFOCOM
1998
IEEE
15 years 7 months ago
A Stochastic Approximation Approach for Max-Min Fair Adaptive Rate Control of ABR Sessions with MCRs
The ABR sessions in an ATM network share the bandwidth left over after guaranteeing service to CBR and VBR traffic. Hence the bandwidth available to ABR sessions is randomly varyi...
Santosh Paul Abraham, Anurag Kumar
COR
2007
108views more  COR 2007»
15 years 3 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
ICIP
2000
IEEE
16 years 5 months ago
Shape Approximation Through Recursive Scalable Layer Generation
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
Gerry Melnikov, Aggelos K. Katsaggelos