7167 search results - page 724 / 1434 » Answer Set Programming |
177
click to vote
WADS
1993
Springer
15 years 11 months ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
205
click to vote
COMPGEOM
2005
ACM
15 years 9 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
207
click to vote
ESWS
2008
Springer
15 years 9 months ago
2008
Springer
We present SHIRI-Annot an automatic ontology-driven and unsupervised approach for the semantic annotation of documents which contain well structured parts and not well structured o...
214
click to vote
EMNLP
2007
15 years 8 months ago
2007
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
232
click to vote
SODA
1993
ACM
15 years 8 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...