3656 search results - page 157 / 732 » Compact Location Problems |
145
click to vote
EUROCAST
2009
Springer
15 years 10 months ago
2009
Springer
The calculation of Hamiltonian Circuits is an NP-complete task. This paper uses slightly modified complete sets of Hamiltonian circuits for the classification of documents. The sol...
155
click to vote
EDBTW
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of querying XML documents which are not valid with respect to given DTDs. We propose a framework for measuring the invalidity of XML documents and compactly...
167
click to vote
EUROGP
2006
Springer
15 years 10 months ago
2006
Springer
This paper introduces a new representation for assemblies of small Lego -like elements: structures are indirectly encoded as construction plans. This representation shows some inte...
166
click to vote
CL
2000
Springer
15 years 10 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
195
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...