1389 search results - page 102 / 278 » Improved Approximation Algorithms for Label Cover Problems |
118
click to vote
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
160
click to vote
SAC
2003
ACM
15 years 8 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
112
click to vote
ECAI
2004
Springer
15 years 6 months ago
2004
Springer
Instance-based learning (IBL) algorithms have proved to be successful in many applications. However, as opposed to standard statistical methods, a prediction in IBL is usually give...
149
click to vote
JCSS
2008
15 years 3 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
129
click to vote
ADHOCNETS
2009
Springer
15 years 1 months ago
2009
Springer
This paper presents a header compression algorithm that unlike previous protocols is capable of compressing MAC headers in a multiple-access (shared) channel. Previous schemes coul...