1985 search results - page 180 / 397 » A Minimal Periods Algorithm with Applications |
127
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
117
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
Stability is a common tool to verify the validity of sample based algorithms. In clustering it is widely used to tune the parameters of the algorithm, such as the number k of clust...
137
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
164
click to vote
ICMCS
2008
IEEE
15 years 10 months ago
2008
IEEE
For Internet based video broadcasting applications such as IPTV, the Peer-to-Peer (P2P) streaming scheme has been found to be an effective solution. An important issue in live bro...
144
click to vote
CLUSTER
2006
IEEE
15 years 10 months ago
2006
IEEE
The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing sys...