3134 search results - page 176 / 627 » Computing full disjunctions |
113
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
102
click to vote
STACS
1999
Springer
15 years 8 months ago
1999
Springer
We investigate the problem of routing traffic through a congested network in an environment of non-cooperative users. We use the worst-case coordination ratio suggested by Koutsou...
143
click to vote
VVS
1998
IEEE
15 years 8 months ago
1998
IEEE
In this paper, we describe a technique to animate volumes using a volumetric skeleton. The skeleton is computed from the actual volume, based on a reversible thinning procedure us...
89
Voted
SIGGRAPH
1998
ACM
15 years 8 months ago
1998
ACM
It has become increasingly difficult to drive a modern highperformance graphics accelerator at full speed with a serial immediate-mode graphics interface. To resolve this problem,...
CVPR
1997
IEEE
15 years 8 months ago
1997
IEEE
A novel scene reconstruction technique is presented, different from previous approaches in its ability to cope with large changes in visibility and its modeling of intrinsic scene...