453 search results - page 34 / 91 » On Approximation of Bookmark Assignments |
120
click to vote
MLG
2007
Springer
15 years 10 months ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
143
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
165
click to vote
RTAS
2006
IEEE
15 years 10 months ago
2006
IEEE
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
106
click to vote
ECCC
2006
15 years 3 months ago
2006
In this note we present an approximation algorithm for MAX 2SAT that given a (1 - ) satisfiable instance finds an assignment of variables satisfying a 1 - O( ) fraction of all co...
113
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...