Sciweavers

3208 search results - page 383 / 642
» A Lower Bound for Primality
Sort
View
SI3D
2003
ACM
15 years 12 months ago
Application of the two-sided depth test to CSG rendering
Shadow mapping is a technique for doing real-time shadowing. Recent work has shown that shadow mapping hardware can be used as a second depth test in addition to the z-test. In th...
Sudipto Guha, Shankar Krishnan, Kamesh Munagala, S...
GBRPR
2003
Springer
15 years 12 months ago
Constructing Stochastic Pyramids by MIDES - Maximal Independent Directed Edge Set
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
Yll Haxhimusa, Roland Glantz, Walter G. Kropatsch
ILP
2003
Springer
15 years 12 months ago
Complexity Parameters for First-Order Classes
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
Marta Arias, Roni Khardon
IMA
2003
Springer
125views Cryptology» more  IMA 2003»
15 years 12 months ago
Commitment Capacity of Discrete Memoryless Channels
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discr...
Andreas Winter, Anderson C. A. Nascimento, Hideki ...
ISAAC
2003
Springer
95views Algorithms» more  ISAAC 2003»
15 years 12 months ago
Finding a Length-Constrained Maximum-Density Path in a Tree
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...
Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao