919 search results - page 139 / 184 » Efficient computation of view subsets |
GD
2000
Springer
14 years 1 months ago
2000
Springer
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
CG
2008
Springer
13 years 10 months ago
2008
Springer
As multi-core processor systems become more and more widespread, the demand for efficient parallel algorithms also propagates into the field of computer graphics. This is especial...
ICPP
1999
IEEE
14 years 2 months ago
1999
IEEE
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
CHI
2004
ACM
14 years 10 months ago
2004
ACM
Each window on our computer desktop provides a view into some information. Although users can currently manipulate multiple windows, we assert that being able to spatially arrange...
EDBT
2004
ACM
14 years 10 months ago
2004
ACM
OGSA-DQP is a distributed query processor exposed to users as an Open Grid Services Architecture (OGSA)-compliant Grid service. This service supports the compilation and evaluation...