Sciweavers

2694 search results - page 291 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 9 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
ICS
2000
Tsinghua U.
15 years 10 months ago
Fast greedy weighted fusion
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
Ken Kennedy
IPPS
2000
IEEE
15 years 11 months ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen
ICMCS
2009
IEEE
96views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Optimizing segment caching for peer-to-peer on-demand streaming
In peer-to-peer (P2P) on-demand streaming applications, multimedia content is divided into segments and peers can seek any segments for viewing at anytime. Since different segment...
Ho-Shing Tang, Shueng-Han Gary Chan, Haochao Li
ATAL
2007
Springer
16 years 24 days ago
Multi-task overlapping coalition parallel formation algorithm
The issue of coalition formation has been investigated from many aspects, but until recently little attention has been paid to overlapping coalition formation. What’s more, an a...
Chao-Feng Lin, Shan-Li Hu