567 search results - page 50 / 114 » Exact train pathing |
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
— The search for optimality in the design of channel precoders and training symbols in block processing communication systems is one of paramount importance. Finding the best tra...
104
click to vote
COLT
2004
Springer
15 years 3 months ago
2004
Springer
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
SIROCCO
2010
15 years 1 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
As more and more multi-tier services are developed from commercial off-the-shelf components or heterogeneous middleware without source code available, both developers and administr...
120
click to vote
SODA
1992
ACM
15 years 1 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...