1274 search results - page 94 / 255 » New Proofs for |
90
Voted
DCC
2007
IEEE
16 years 9 days ago
2007
IEEE
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 ...
126
click to vote
DFG
2009
Springer
15 years 7 months ago
2009
Springer
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...
85
Voted
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
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...
73
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
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...
133
click to vote
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
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...