7930 search results - page 601 / 1586 » Greedy in Approximation Algorithms |
182
click to vote
DAM
2010
15 years 7 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
190
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
239
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
198
click to vote
ICNP
2007
IEEE
16 years 1 months ago
2007
IEEE
— P2P streaming tries to achieve scalability (like P2P file distribution) and at the same time meet real-time playback requirements. It is a challenging problem still not well u...
190
click to vote
ILP
2003
Springer
16 years 11 days ago
2003
Springer
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...