1469 search results - page 282 / 294 » Approximate polynomial decomposition |
STOC
2003
ACM
16 years 3 days ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
193
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
121
click to vote
PODS
2008
ACM
15 years 12 months ago
2008
ACM
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
108
click to vote
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...