Sciweavers

1675 search results - page 19 / 335
» Implementing Data Cubes Efficiently
Sort
View
JSA
2000
90views more  JSA 2000»
13 years 9 months ago
An efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessors
This paper presents an efficient routing and flow control mechanism to implement multidestination message passing in wormhole networks.It is targeted to situations where the size ...
Manuel P. Malumbres, José Duato
MICRO
2000
IEEE
107views Hardware» more  MICRO 2000»
14 years 1 months ago
Register integration: a simple and efficient implementation of squash reuse
Register integration (or simply integration) is a mechanism for incorporating speculative results directly into a sequential execution using data-dependence relationships. In this...
Amir Roth, Gurindar S. Sohi
ICML
2008
IEEE
14 years 10 months ago
Fast solvers and efficient implementations for distance metric learning
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
Kilian Q. Weinberger, Lawrence K. Saul
JCST
2006
65views more  JCST 2006»
13 years 9 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
JCP
2008
174views more  JCP 2008»
13 years 9 months ago
Design and Implementation of Spatial Data Mining System (M-SDM) based on MATLAB
Taking the design of data analyzing software for imaging brain function -- SPM (Statistical Parameters Mapping) for reference, this study combined MATLAB, GIS and SDM organically, ...
Lu Zhao, Xinqi Zheng, Shuqing Wang