Sciweavers

1521 search results - page 2 / 305
» The Stardinates - Visualizing Highly Structured Data
Sort
View
PKDD
1999
Springer
90views Data Mining» more  PKDD 1999»
13 years 11 months ago
Learning from Highly Structured Data by Decomposition
This paper addresses the problem of learning from highly structured data. Speci cally, it describes a procedure, called decomposition, that allows a learner to access automatically...
René MacKinney-Romero, Christophe G. Giraud...
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
14 years 2 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
PPAM
2007
Springer
14 years 1 months ago
New Data Structures for Matrices and Specialized Inner Kernels: Low Overhead for High Performance
Dense linear algebra codes are often expressed and coded in terms of BLAS calls. This approach, however, achieves suboptimal performance due to the overheads associated to such cal...
José R. Herrero
CONEXT
2009
ACM
13 years 8 months ago
MDCube: a high performance network structure for modular data center interconnection
Shipping-container-based data centers have been introduced as building blocks for constructing mega-data centers. However, it is a challenge on how to interconnect those container...
Haitao Wu, Guohan Lu, Dan Li, Chuanxiong Guo, Yong...
WDAS
2000
13 years 8 months ago
Scalable Distributed Data Structures for High-Performance Databases
Present databases, whether on centralized or parallel DBMSs, do not deal well with scalability. We present an architecture for Wintel multicomputers termed AMOS-SDDS, coupling a h...
Yakham Ndiaye, Aly Wane Diene, Witold Litwin, Tore...