Sciweavers

2485 search results - page 208 / 497
» Time Bounded Frequency Computations
Sort
View
SIGMOD
2010
ACM
159views Database» more  SIGMOD 2010»
15 years 5 months ago
Histograms reloaded: the merits of bucket diversity
Virtually all histograms store for each bucket the number of distinct values it contains and their average frequency. In this paper, we question this paradigm. We start out by inv...
Carl-Christian Kanne, Guido Moerkotte
FOCS
2007
IEEE
16 years 27 days ago
Strongly History-Independent Hashing with Applications
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
Guy E. Blelloch, Daniel Golovin
TCS
2011
15 years 1 months ago
Dynamic normal forms and dynamic characteristic polynomial
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
Gudmund Skovbjerg Frandsen, Piotr Sankowski
FOCS
1998
IEEE
15 years 10 months ago
Unsatisfiable Systems of Equations, Over a Finite Field
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
Alan R. Woods
ARITH
2007
IEEE
16 years 27 days ago
Accurate Multiple-Precision Gauss-Legendre Quadrature
Numerical integration is an operation that is frequently available in multiple precision numerical software packages. The different quadrature schemes used are considered well stu...
Laurent Fousse