10988 search results - page 122 / 2198 » Algorithmic Folding Complexity |
130
click to vote
WG
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
123
click to vote
TMC
2008
15 years 3 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
111
click to vote
WG
2005
Springer
15 years 8 months ago
2005
Springer
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
132
click to vote
DCC
2004
IEEE
16 years 2 months ago
2004
IEEE
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...
119
click to vote
SOFSEM
2010
Springer
16 years 2 days ago
2010
Springer
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...