Sciweavers

1380 search results - page 137 / 276
» A General Polynomial Sieve
Sort
View
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 10 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
ICIP
2008
IEEE
14 years 11 months ago
A near optimal coder for image geometry with adaptive partitioning
In this paper, we present a new framework to compress the geometry of images. This framework generalizes the standard quad partitioning approaches in compression of image geometry ...
Arian Maleki, Morteza Shahram, Gunnar Carlsson
WIA
2009
Springer
14 years 4 months ago
Implementation of State Elimination Using Heuristics
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...
Jae-Hee Ahn, Yo-Sub Han
ESA
2009
Springer
130views Algorithms» more  ESA 2009»
14 years 4 months ago
On the Performance of Approximate Equilibria in Congestion Games
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
George Christodoulou, Elias Koutsoupias, Paul G. S...
FCT
2009
Springer
14 years 4 months ago
Computing Role Assignments of Chordal Graphs
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
Pim van 't Hof, Daniël Paulusma, Johan M. M. ...