7930 search results - page 30 / 1586 » Greedy in Approximation Algorithms |
103
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
251
Voted
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...
101
click to vote
ENTCS
2007
15 years 2 months ago
2007
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
105
click to vote
COLING
2010
14 years 9 months ago
2010
Model minimization has been shown to work well for the task of unsupervised part-of-speech tagging with a dictionary. In (Ravi and Knight, 2009), the authors invoke an integer pro...
107
Voted
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...