1208 search results - page 59 / 242 » Uniform eventown problems |
254
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
Skewis prevalentin manydata sourcessuchas IP traffic streams. To continually summarize the distribution of such data, a highbiased set of quantiles (e.g., 50th, 90th and 99th perc...
158
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
148
click to vote
FTRTFT
1998
Springer
15 years 10 months ago
1998
Springer
Predictability is crucial in critical applications and systems. Therefore, we examine sources of uncertainty for each of the four phases that span a project lifecycle, from initial...
106
click to vote
COMGEO
2010
ACM
15 years 6 months ago
2010
ACM
The floodlight illumination problem asks whether there exists a one-to-one placement of n floodlights illuminating infinite wedges of angles 1, . . . , n at n sites p1, . . . , pn...
174
click to vote
DATAMINE
1998
15 years 5 months ago
1998
Data mining evolved as a collection of applicative problems and efficient solution algorithms relative to rather peculiar problems, all focused on the discovery of relevant infor...