Sciweavers

4171 search results - page 461 / 835
» Distributed Data Structure Design for Scientific Computation
Sort
View
209
Voted
SLIP
2004
ACM
16 years 8 days ago
Optical solutions for system-level interconnect
Throughput, power consumption, signal integrity, pin count and routing complexity are all increasingly important interconnect issues that the system designer must deal with. Recen...
Ian O'Connor
GCC
2006
Springer
15 years 10 months ago
Hierarchical Replica Location Service Based on Hybrid Overlay Platform
An important problem that confronts data grid applications is to efficiently locate the node that stores a particular data replica. This paper proposes a Hierarchical Replica Loca...
Jianjin Jiang, Guangwen Yang, Yongwei Wu, Wusheng ...
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 8 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
253
Voted
SIGMOD
2008
ACM
107views Database» more  SIGMOD 2008»
16 years 7 months ago
Outlier-robust clustering using independent components
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Christian Böhm, Christos Faloutsos, Claudia P...
204
Voted
PERVASIVE
2010
Springer
16 years 1 months ago
Common Sense Community: Scaffolding Mobile Sensing and Analysis for Novice Users
As sensing technologies become increasingly distributed and democratized, citizens and novice users are becoming responsible for the kinds of data collection and analysis that have...
Wesley Willett, Paul M. Aoki, Neil Kumar, Sushmita...