4843 search results - page 131 / 969 » The Shortcut Problem - Complexity and Approximation |
STACS
2010
Springer
14 years 8 months ago
2010
Springer
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...
HICSS
2009
IEEE
15 years 5 months ago
2009
IEEE
One knowledge discovery problem in the rapid response setting is the cost of learning which patterns are indicative of a threat. This typically involves a detailed follow-through,...
68
Voted
CPM
2004
Springer
15 years 3 months ago
2004
Springer
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
98
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Cross-layer design and operation of wireless networks has attracted significant interest in the last decade, yet some basic problems in the area remain unsolved. In this paper, w...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper explores the approximation properties of a unique basis expansion, which realizes a bilinear frequency warping between a continuous-time signal and its discrete-time re...