2168 search results - page 178 / 434 » Randomized Algorithms and Complexity Theory |
144
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
128
click to vote
SODA
2010
ACM
16 years 28 days ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
128
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
136
Voted
MST
2010
15 years 1 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
137
Voted
INFOVIS
2003
IEEE
15 years 8 months ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...