632 search results - page 113 / 127 » On the Approximability of the Steiner Tree Problem |
ESA
2006
Springer
13 years 11 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
PAMI
2006
13 years 7 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
DIALM
2005
ACM
13 years 9 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
INFOCOM
2003
IEEE
14 years 25 days ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
EUROPAR
2005
Springer
14 years 1 months ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...