Sciweavers

2127 search results - page 362 / 426
» Computing large matchings fast
Sort
View
SAC
2002
ACM
14 years 11 months ago
Decision tree classification of spatial data streams using Peano Count Trees
Many organizations have large quantities of spatial data collected in various application areas, including remote sensing, geographical information systems (GIS), astronomy, compu...
Qiang Ding, Qin Ding, William Perrizo
CCGRID
2010
IEEE
14 years 9 months ago
Dynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...
Tatsuhiro Chiba, Mathijs den Burger, Thilo Kielman...

Publication
173views
13 years 11 months ago
Max-Flow Segmentation of the Left Ventricle by Recovering Subject-Specific Distributions via a Bound of the Bhattacharyya Measur
This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two or...
Ismail Ben Ayed, Hua-mei Chen, Kumaradevan Punitha...
HPCA
2012
IEEE
13 years 7 months ago
Improving write operations in MLC phase change memory
Phase change memory (PCM) recently has emerged as a promising technology to meet the fast growing demand for large capacity memory in modern computer systems. In particular, multi...
Lei Jiang, Bo Zhao, Youtao Zhang, Jun Yang 0002, B...
EDBT
2008
ACM
206views Database» more  EDBT 2008»
15 years 12 months ago
Designing an inductive data stream management system: the stream mill experience
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo