3267 search results - page 443 / 654 » Generalized quasirandom graphs |
164
click to vote
SIGADA
2004
Springer
15 years 12 months ago
2004
Springer
Refactoring is a technique for restructuring code to improve its design. A tool for automatically applying refactoring transformations to Ada 95 programs is described. The tool is...
151
click to vote
ACSAC
2003
IEEE
15 years 12 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
169
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
151
click to vote
ICDAR
2003
IEEE
15 years 12 months ago
2003
IEEE
We are concerned with the extraction of tables from exchange format representations of very diverse composite documents. We put forward a flexible representation scheme for comple...
155
click to vote
ISIPTA
2003
IEEE
15 years 12 months ago
2003
IEEE
Independence models induced by some uncertainty measures (e.g. conditional probability, possibility) do not obey the usual graphoid properties, since they do not satisfy the symme...