Sciweavers

1274 search results - page 94 / 255
» New Proofs for
Sort
View
DCC
2007
IEEE
14 years 9 months ago
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, ...
DFG
2009
Springer
14 years 4 months ago
Models of Non-atomic Congestion Games - From Unicast to Multicast Routing
Abstract. We give an overview of important results for non-atomic congestion games in their traditional form along with self-contained and short proofs and then present new results...
Lasse Kliemann, Anand Srivastav
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
13 years 5 months ago
On the dissipativity of pseudorational behaviors
This paper studies dissipativity for a class of infinite-dimensional systems, called pseudorational, in the behavioral context. A basic equivalence condition for dissipativity is e...
Masaki Ogura, Yutaka Yamamoto, Jan C. Willems
LICS
2008
IEEE
14 years 4 months ago
From Axioms to Analytic Rules in Nonclassical Logics
We introduce a systematic procedure to transform large classes of (Hilbert) axioms into equivalent inference rules in sequent and hypersequent calculi. This allows for the automat...
Agata Ciabattoni, Nikolaos Galatos, Kazushige Teru...