699 search results - page 28 / 140 » The method of combinatorial telescoping |
120
Voted
ALMOB
2006
15 years 17 days ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
116
Voted
CORR
2002
Springer
15 years 9 days ago
2002
Springer
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
122
Voted
SPAA
2004
ACM
15 years 6 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
116
Voted
SIAMJO
2011
14 years 6 months ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
103
Voted
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...