7930 search results - page 303 / 1586 » Greedy in Approximation Algorithms |
176
click to vote
IJCAI
2007
15 years 8 months ago
2007
In recent years, metric learning in the semisupervised setting has aroused a lot of research interests. One type of semi-supervised metric learning utilizes supervisory informatio...
180
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
184
click to vote
ISVC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper presents a straightforward top-down segmentation method based on a contour approach on histological images. Our approach relies on a digital deformable model w...
162
click to vote
GLOBECOM
2007
IEEE
16 years 29 days ago
2007
IEEE
— Waterfilling and mercury/waterfilling power allocation policies maximize the mutual information of independent parallel Gaussian-noise channels under an average power constra...
170
click to vote
CEC
2005
IEEE
16 years 8 days ago
2005
IEEE
Abstract- The complexity of the static scheduling problem on heterogeneous resources has motivated the development of low complexity heuristics such as list scheduling. However, th...