209 search results - page 21 / 42 » The Computational Complexity of Weak Saddles |
VVS
2000
IEEE
13 years 12 months ago
2000
IEEE
This paper evaluates and compares four volume rendering algorithms that have become rather popular for rendering datasets described on uniform rectilinear grids: raycasting, splat...
MOR
2010
13 years 6 months ago
2010
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
ICCSA
2005
Springer
14 years 1 months ago
2005
Springer
Recently, Nenadi´c et al. (2004) proposed the RSA-CEGD protocol for certified delivery of e-goods. This is a relatively complex scheme based on verifiable and recoverable encryp...
ICALP
2010
Springer
14 years 9 days ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
PDP
1996
IEEE
13 years 11 months ago
1996
IEEE
A case study of performance and dependability evaluation of fault-tolerant multiprocessors is presented. Two specific architectures are analyzed taking into account system functio...