870 search results - page 71 / 174 » Theoretical and experimental results on the goal-plan tree p... |
MFCS
2007
Springer
15 years 4 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
TCSV
2002
14 years 9 months ago
2002
In this paper, we address the problem of real-time video streaming over wireless LANs for both unicast and multicast transmission. The wireless channel is modeled as a packet-erasu...
COLT
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...
100
click to vote
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...