4114 search results - page 110 / 823 » Efficient Algorithms for the 2-Center Problems |
176
click to vote
ICMLA
2009
15 years 4 months ago
2009
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
201
click to vote
AAAI
1994
15 years 7 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
154
click to vote
NAACL
2010
15 years 4 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...
188
click to vote
COMPGEOM
2001
ACM
15 years 10 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...
157
click to vote
ISCAS
1994
IEEE
15 years 10 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...