3422 search results - page 322 / 685 » Random Subset Optimization |
147
click to vote
DCG
2000
15 years 4 months ago
2000
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
141
click to vote
TSMC
2002
15 years 4 months ago
2002
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
137
click to vote
JCO
2010
15 years 3 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
137
click to vote
EMNLP
2010
15 years 2 months ago
2010
Syntactic consistency is the preference to reuse a syntactic construction shortly after its appearance in a discourse. We present an analysis of the WSJ portion of the Penn Treeba...
138
click to vote
SUM
2010
Springer
15 years 2 months ago
2010
Springer
Dung's abstract argumentation model consists of a set of arguments and a binary relation encoding attacks among arguments. Different acceptability semantics have been defined ...