355 search results - page 29 / 71 » A New Approximation Technique for Resource-Allocation Proble... |
WEA
2007
Springer
15 years 6 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
PODC
2006
ACM
15 years 5 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
JUCS
2006
14 years 11 months ago
2006
Abstract: Advances in technology now make it possible to integrate hundreds of cores (e.g. general or special purpose processors, embedded memories, application specific components...
ISM
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...