3875 search results - page 674 / 775 » Approximation Algorithms for the Max-coloring Problem |
SRDS
2006
IEEE
14 years 3 months ago
2006
IEEE
We consider the problem of ensuring high data availability in federated content sharing systems. Ideally, such a system would provide high data availability in a device transparen...
IMR
2004
Springer
14 years 2 months ago
2004
Springer
Sweep method is one of the most robust techniques to generate hexahedral meshes in extrusion volumes. One of the main issues to be dealt by any sweep algorithm is the projection o...
EDBT
2004
ACM
14 years 9 months ago
2004
ACM
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...