Sciweavers

2826 search results - page 440 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 7 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
CF
2009
ACM
16 years 1 months ago
Space-and-time efficient garbage collectors for parallel systems
As multithreaded server applications and runtime systems prevail, garbage collection is becoming an essential feature to support high performance systems. The fundamental issue of...
Shaoshan Liu, Ligang Wang, Xiao-Feng Li, Jean-Luc ...
ICPP
2007
IEEE
16 years 24 days ago
Improving Search Using a Fault-Tolerant Overlay in Unstructured P2P Systems
Gnutella overlays have evolved to use a two-tier topology. However, we observed that the new topology had only achieved modest improvements in search success rates. Also, the new ...
William Acosta, Surendar Chandra
JCDL
2006
ACM
159views Education» more  JCDL 2006»
16 years 13 days ago
EcoPod: a mobile tool for community based biodiversity collection building
Biological studies rely heavily on large collections of species observations. All of these collections cannot be compiled by biology professionals alone. Skilled amateurs can assi...
YuanYuan Yu, Jeannie A. Stamberger, Aswath Manohar...
IEEEPACT
2002
IEEE
15 years 11 months ago
A Framework for Parallelizing Load/Stores on Embedded Processors
Many modern embedded processors (esp. DSPs) support partitioned memory banks (also called X-Y memory or dual bank memory) along with parallel load/store instructions to achieve co...
Xiaotong Zhuang, Santosh Pande, John S. Greenland ...