Sciweavers

131 search results - page 13 / 27
» Cross-layer optimization made practical
Sort
View
IPPS
2000
IEEE
14 years 3 months ago
Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity ON , where 2  3. We show that such an algorithm can be parallelize...
Keqin Li
3DPVT
2004
IEEE
188views Visualization» more  3DPVT 2004»
14 years 2 months ago
3D Shape Registration using Regularized Medial Scaffolds
This paper proposes a novel method for global registration based on matching 3D medial structures of unorganized point clouds or triangulated meshes. Most practical known methods ...
Ming-Ching Chang, Frederic F. Leymarie, Benjamin B...
AINA
2008
IEEE
14 years 28 days ago
An Efficient Tree Structure for Delay Sensitive Data Gathering in Wireless Sensor Networks
It is important to design an energy efficient data gathering tree structure for wireless sensor networks. As for the energy efficiency, network's overall energy consumption an...
Soonmok Kwon, Jeonggyu Kim, Cheeha Kim
WSDM
2012
ACM
259views Data Mining» more  WSDM 2012»
12 years 6 months ago
Learning recommender systems with adaptive regularization
Many factorization models like matrix or tensor factorization have been proposed for the important application of recommender systems. The success of such factorization models dep...
Steffen Rendle
VLDB
1998
ACM
127views Database» more  VLDB 1998»
14 years 3 months ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...