7930 search results - page 47 / 1586 » Greedy in Approximation Algorithms |
136
click to vote
GRC
2010
IEEE
15 years 3 months ago
2010
IEEE
We present a problem of factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, an...
119
click to vote
IPCO
1992
15 years 3 months ago
1992
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
109
click to vote
CAIP
2003
Springer
15 years 7 months ago
2003
Springer
Active contours, very popular in image segmentation, suffer from delicate adjustments of many parameters. We propose to carry out these adjustments using genetic algorithm. Here an...
109
Voted
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...