2095 search results - page 197 / 419 » Improved pebbling bounds |
160
click to vote
DATESO
2004
15 years 8 months ago
2004
In this paper pivoting M-tree (PM-tree) is introduced, a metric access method combining M-tree with the pivot-based approach. While in M-tree a metric region is represented by a hy...
166
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (wit...
142
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...
154
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
152
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
In 2006, Smith et al. published a new table of constant weight codes, updating existing tables originally created by Brouwer et al. This paper improves upon these results by fill...