Sciweavers

1887 search results - page 80 / 378
» Clustering with Local Restrictions
Sort
View
JILP
2000
90views more  JILP 2000»
14 years 9 months ago
Speculative Updates of Local and Global Branch History: A Quantitative Analysis
In today's wide-issue processors, even small branch-misprediction rates introduce substantial performance penalties. Worse yet, inadequate branch prediction creates a bottlen...
Kevin Skadron, Margaret Martonosi, Douglas W. Clar...
GIS
2010
ACM
14 years 8 months ago
Exploiting local node cache in top-k queries within wireless sensor networks
Top-k queries are a popular type of query in Wireless Sensor Networks. Typical solutions rely on coordinated root-tonodes and nodes-to-root messages and on maintaining filters at...
Johannes Niedermayer, Mario A. Nascimento, Matthia...
ECCC
2011
183views ECommerce» more  ECCC 2011»
14 years 4 months ago
Extractors and Lower Bounds for Locally Samplable Sources
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
Anindya De, Thomas Watson
OTM
2005
Springer
15 years 3 months ago
Distributed Authentication in GRID5000
Abstract. Between high-performance clusters and grids appears an intermediate infrastructure called cluster grid that corresponds to the interconnection of clusters through the Int...
Sébastien Varrette, Sebastien Georget, Joha...
COMPGEOM
2001
ACM
15 years 1 months ago
Discrete mobile centers
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...