Sciweavers

3341 search results - page 465 / 669
» On Bounded Queries and Approximation
Sort
View
FOCS
1999
IEEE
15 years 11 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
ICIP
2001
IEEE
16 years 8 months ago
On the compression of two-dimensional piecewise smooth functions
It is well known that wavelets provide good non-linear approximation of one-dimensional (1-D) piecewise smooth functions. However, it has been shown that the use of a basis with g...
Pier Luigi Dragotti, Minh N. Do, Rahul Shukla, Mar...
ICML
2005
IEEE
16 years 7 months ago
Bayesian hierarchical clustering
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
Katherine A. Heller, Zoubin Ghahramani
PODS
2009
ACM
110views Database» more  PODS 2009»
16 years 7 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
MOBIHOC
2002
ACM
16 years 6 months ago
Constructing minimum-energy broadcast trees in wireless ad hoc networks
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider t...
Weifa Liang