1390 search results - page 169 / 278 » Computing the depth of a flat |
VMV
2003
14 years 11 months ago
2003
We present a new algorithm for the computation of volumetric intersections of geometrically complex objects, which can be used for the efficient detection of collisions. Our appr...
ACTA
2007
14 years 10 months ago
2007
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
119
click to vote
SG
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. In this work, we present an automated system for creating hedcut illustrations, portraits rendered using small image feature aligned dots (stipples). We utilize edge dete...
ACL
2010
14 years 8 months ago
2010
Once released, treebanks tend to remain unchanged despite any shortcomings in their depth of linguistic analysis or coverage of specific phenomena. Instead, separate resources are...