13306 search results - page 380 / 2662 » Theoretical Computer Science |
156
Voted
FSTTCS
2009
Springer
16 years 2 months ago
2009
Springer
The rigidity of a matrix A for target rank r is the minimum number of entries of A that
170
Voted
FSTTCS
2009
Springer
16 years 2 months ago
2009
Springer
The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
159
Voted
FSTTCS
2009
Springer
16 years 2 months ago
2009
Springer
ABSTRACT. We present a simple exact algorithm for the INDEPENDENT SET problem with a run
149
Voted
MFCS
2005
Springer
16 years 29 days ago
2005
Springer
We propose a method to approximate a polygonal object by a deformable smooth surface, namely the t-skin defined by Edelsbrunner [5]
160
click to vote
ICALP
2004
Springer
16 years 26 days ago
2004
Springer
This paper studies the problem of matching sequences against regular expressions in order to produce structured values.