Sciweavers

1632 search results - page 62 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
109
Voted
ATAL
2007
Springer
15 years 9 months ago
Periodic real-time resource allocation for teams of progressive processing agents
In this paper, we focus on the problem of finding a periodic allocation strategy for teams of resource-bounded agents. We propose a real-time dynamic algorithm RTDA , that exploi...
Jilles Steeve Dibangoye, Abdel-Illah Mouaddib, Bra...
133
Voted
CVPR
2006
IEEE
15 years 9 months ago
Learning Non-Metric Partial Similarity Based on Maximal Margin Criterion
The performance of many computer vision and machine learning algorithms critically depends on the quality of the similarity measure defined over the feature space. Previous works...
Xiaoyang Tan, Songcan Chen, Jun Li, Zhi-Hua Zhou
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 3 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
165
Voted
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
16 years 25 days ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
ALGORITHMICA
2008
88views more  ALGORITHMICA 2008»
15 years 3 months ago
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
Andreas Björklund, Thore Husfeldt