2370 search results - page 57 / 474 » The Characterization of Data-Accumulating Algorithms |
ESA
2006
Springer
15 years 1 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
We present a quantitative evaluation of SE-MinCut, a novel segmentation algorithm based on spectral embedding and minimum cut. We use human segmentations from the Berkeley Segment...
108
click to vote
TPDS
1998
14 years 9 months ago
1998
—Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for no...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
COCOON
2005
Springer
14 years 11 months ago
2005
Springer
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...