360 search results - page 33 / 72 » Distributed Network Querying with Bounded Approximate Cachin... |
144
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
We study the problem of applying adaptive filters for approximate query processing in a distributed stream environment. We propose filter bound assignment protocols with the obj...
165
click to vote
IJAHUC
2008
15 years 6 months ago
2008
: Following Etherington, Hoge and Parkes, we consider a network consisting of (approximately) N transceivers in the plane R2 distributed randomly with density given by a Gaussian d...
211
click to vote
JUCS
2010
15 years 21 days ago
2010
: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous fu...
165
click to vote
NN
2002
Springer
15 years 5 months ago
2002
Springer
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
155
click to vote
INFOCOM
2009
IEEE
16 years 17 days ago
2009
IEEE
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...