4110 search results - page 125 / 822 » Efficient algorithms for the 2-gathering problem |
148
click to vote
AUSDM
2008
Springer
15 years 6 months ago
2008
Springer
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
129
click to vote
SIAMJO
2008
15 years 4 months ago
2008
We study the second-order feasibility cone F = {y IRn : My gT y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decompo...
106
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there...
154
click to vote
CVPR
2010
IEEE
15 years 2 months ago
2010
IEEE
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
119
click to vote
IEICET
2006
15 years 4 months ago
2006
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...