Sciweavers

3415 search results - page 253 / 683
» Lower bounds on kernelization
Sort
View
ALT
2002
Springer
16 years 3 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...
INFOCOM
2007
IEEE
16 years 29 days ago
Optimal-Complexity Optical Router
—In the past years, electronic routers have had trouble keeping up with the increase in optical fiber capacity. As their power consumption has grown exponentially and already ex...
Hadas Kogan, Isaac Keslassy
COCOON
2007
Springer
16 years 25 days ago
Streaming Algorithms Measured in Terms of the Computed Quantity
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Shengyu Zhang
HYBRID
2007
Springer
16 years 25 days ago
A Partial Order Approach to Discrete Dynamic Feedback in a Class of Hybrid Systems
Abstract. We consider the dynamic feedback problem in a class of hybrid systems modeled as (infinite) state deterministic transition systems, in which the continuous variables are...
Domitilla Del Vecchio
ICALP
2007
Springer
16 years 25 days ago
An Optimal Decomposition Algorithm for Tree Edit Distance
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...