Sciweavers

7773 search results - page 114 / 1555
» On generalized Frame-Stewart numbers
Sort
View
PODS
2006
ACM
98views Database» more  PODS 2006»
15 years 10 months ago
Processing queries on tree-structured data efficiently
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
Christoph Koch
FOCS
2006
IEEE
15 years 4 months ago
Input-Indistinguishable Computation
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...
Silvio Micali, Rafael Pass, Alon Rosen
ANTS
2000
Springer
92views Algorithms» more  ANTS 2000»
15 years 2 months ago
Computing Special Values of Partial Zeta Functions
We discuss computation of the special values of partial zeta functions associated to totally real number fields. The main tool is the Eisenstein cocycle Ψ, a group cocycle for GL...
Gautam Chinta, Paul E. Gunnells, Robert Sczech
COMPGEOM
1999
ACM
15 years 2 months ago
The Path of a Triangulation
We define the path of a pseudo-triangulation, a data structure generalizing the path of a triangulation of a point set. This structure allows us to use divide-andconquer type of ...
Oswin Aichholzer
CORR
2012
Springer
193views Education» more  CORR 2012»
13 years 5 months ago
Approximate Counting of Matchings in Sparse Hypergraphs
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska