130 search results - page 21 / 26 » Exact Algorithms for Exact Satisfiability and Number of Perf... |
ALENEX
2009
13 years 8 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
TCS
2008
13 years 7 months ago
2008
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
SIGIR
1998
ACM
13 years 11 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
ACNS
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. We study the setting in which a user stores encrypted documents (e.g. e-mails) on an untrusted server. In order to retrieve documents satisfying a certain search criterio...
ICALP
1992
Springer
13 years 11 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...