2434 search results - page 238 / 487 » Algorithmic Randomness of Closed Sets |
130
click to vote
COLING
2008
15 years 5 months ago
2008
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
118
click to vote
COR
2007
15 years 4 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
145
click to vote
PODS
2008
ACM
16 years 4 months ago
2008
ACM
Data exchange, also known as data translation, has been extensively investigated in recent years. One main direction of research has focused on the semantics and the complexity of...
147
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
147
click to vote
GIAE
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we propose the wireframe representation of nD object, which is a single 2D line drawing. A wireframe model of an nD object is composed of a set of edges connecting a...