157 search results - page 13 / 32 » Compact representations of separable graphs |
AVI
2008
13 years 8 months ago
2008
Programming assignments are easy to plagiarize in such a way as to foil casual reading by graders. Graders can resort to automatic plagiarism detection systems, which can generate...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
This paper presents a technique for lossy compression of dense range images. Two separate compression schemes are applied. The first scheme (geometric compression) reduces redunda...
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
CPM
1994
Springer
13 years 11 months ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
SOCO
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...