344 search results - page 25 / 69 » The Directed Minimum Latency Problem |
88
Voted
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper, we address the problem of finding the pre-image of a feature vector in the feature space induced by a kernel. This is of central importance in some kernel applicatio...
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
65
Voted
ICIP
2010
IEEE
14 years 7 months ago
2010
IEEE
Active models are widely used in applications like image segmentation and tracking. Region-based active models are known for robustness to weak edges and high computational comple...
96
Voted
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—With the advent of new applications, one of the primary applications supported in downlink cellular systems is streaming video. QoS for streaming video entails data transmission...