Sciweavers

176 search results - page 35 / 36
» Sorting and Selection with Random Costs
Sort
View
IDEAS
2003
IEEE
131views Database» more  IDEAS 2003»
14 years 1 months ago
Neighborhood Signatures for Searching P2P Networks
Overlay networks have received a lot of attention due to the recent wide-spread use of peer-to-peer (P2P) applications such as SETI, Napster, Gnutella, and Morpheus. Through repli...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 24 days ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
CIKM
2006
Springer
13 years 11 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum
SAC
2010
ACM
13 years 8 months ago
Efficient mapping and voltage islanding technique for energy minimization in NoC under design constraints
Voltage islanding technique in Network-on-Chip (NoC) can significantly reduce the computational energy consumption by scaling down the voltage levels of the processing elements (P...
Pavel Ghosh, Arunabha Sen
RAS
2006
123views more  RAS 2006»
13 years 7 months ago
Planning exploration strategies for simultaneous localization and mapping
In this paper, we present techniques that allow one or multiple mobile robots to efficiently explore and model their environment. While much existing research in the area of Simul...
Benjamín Tovar, Lourdes Muñoz-G&oacu...