4744 search results - page 423 / 949 » Connected Computing |
133
click to vote
CG
2007
Springer
15 years 5 months ago
2007
Springer
We present an efficient compression scheme for animated sequences of triangular meshes of the same connectivity. The proposed algorithm exploits the temporal coherence of the geo...
142
click to vote
JAIR
2008
15 years 5 months ago
2008
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
139
click to vote
KER
2008
15 years 5 months ago
2008
This article surveys existing practical implementations of both defeasible and argumentationbased reasoning engines and associated literature. We aim to summarise the current stat...
165
click to vote
GC
2007
Springer
15 years 5 months ago
2007
Springer
For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman propo...
140
click to vote
CG
2002
Springer
15 years 5 months ago
2002
Springer
: In raster graphics, a line is displayed as a sequence of connected pixels that best approximate the line with minimum deviation. The displacement code of a line is a sequence of ...