494 search results - page 76 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
COMPGEOM
2010
ACM
14 years 24 days ago
2010
ACM
We consider the problem of reconstructing a compact 3manifold (with boundary) embedded in R3 from its crosssections with a given set of cutting planes having arbitrary orientation...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
WIA
2009
Springer
14 years 2 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
FOIKS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
FSTTCS
2003
Springer
14 years 28 days ago
2003
Springer
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...