4112 search results - page 96 / 823 » Efficient Algorithms for the Spoonerism Problem |
132
Voted
NAACL
2010
15 years 2 months ago
2010
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
160
click to vote
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
131
Voted
ISCAS
1994
IEEE
15 years 8 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
267
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
128
click to vote
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...