Sciweavers

2826 search results - page 444 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
DAC
2005
ACM
16 years 7 months ago
Memory access optimization through combined code scheduling, memory allocation, and array binding in embedded system design
In many of embedded systems, particularly for those with high data computations, the delay of memory access is one of the major bottlenecks in the system's performance. It ha...
Jungeun Kim, Taewhan Kim
ICCV
2007
IEEE
15 years 10 months ago
Diffusion Maps Segmentation of Magnetic Resonance Q-Ball Imaging
We present a Diffusion Maps clustering method applied to diffusion MRI in order to segment complex white matter fiber bundles. It is well-known that diffusion tensor imaging (DTI)...
Demian Wassermann, Maxime Descoteaux, Rachid Deric...
PPSC
1993
15 years 7 months ago
I/O for TFLOPS Supercomputers
Scalable parallel computers with TFLOPS (Trillion FLoating Point Operations Per Second) performance levels are now under construction. While we believe TFLOPS processor technology...
Erik DeBenedictis, Stephen C. Johnson
BROADNETS
2007
IEEE
16 years 25 days ago
Optimizing dimensionality and accelerating landmark positioning for coordinates based RTT predictions
Abstract— In this paper we analyze the positioning of landmarks in coordinates-based Internet distance prediction approaches with focus on Global Network Positioning (GNP). We sh...
Dragan Milic, Torsten Braun
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
13 years 9 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu