4171 search results - page 415 / 835 » Choice numbers of graphs |
170
click to vote
EGH
2005
Springer
16 years 14 days ago
2005
Springer
We present a novel method for rendering shadow volumes. The core idea of the method is to locally choose between Z-pass and Z-fail algorithms on a per-tile basis. The choice is ma...
178
click to vote
IFIP
2005
Springer
16 years 13 days ago
2005
Springer
An appealing feature of interior methods for linear programming is that the number of iterations required to solve a problem tends to be relatively insensitive to the choice of in...
160
click to vote
EDBTW
2004
Springer
16 years 10 days ago
2004
Springer
In this paper, we investigate how existing social networks can benefit P2P data networks by leveraging the inherent trust associated with social links. We present a trust model t...
173
click to vote
IFIP
2004
Springer
16 years 9 days ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
144
click to vote
IWDC
2004
Springer
16 years 9 days ago
2004
Springer
Reliability is one of the most important attributes of any system. Adding redundancy is one way to improve the reliability. In this paper, we consider linear VLSI arrays in which e...