501 search results - page 69 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
WG
2010
Springer
13 years 6 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
DLOG
2010
13 years 5 months ago
2010
In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We ...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
DRR
2010
13 years 10 months ago
2010
Scaling up document-image classifiers to handle an unlimited variety of document and image types poses serious challenges to conventional trainable classifier technologies. Highly...
COMCOM
2004
13 years 7 months ago
2004
Bandwidth-delay product (BDP) and its upper bound (BDP-UB) have been well-understood in wireline networks such as the Internet. However, they have not been carefully studied in th...