3422 search results - page 93 / 685 » Random Subset Optimization |
153
Voted
TVCG
2011
14 years 9 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
144
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
168
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
105
Voted
ICDT
2005
ACM
15 years 8 months ago
2005
ACM
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
85
Voted
TSMC
2002
15 years 2 months ago
2002
An extended algorithm of the relative reward strength algorithm is proposed. It is shown that the proposed algorithm ensures the convergence with probability 1 to the optimal path ...