Sciweavers

130 search results - page 22 / 26
» Binary Representations for General CSPs
Sort
View
CGF
2010
105views more  CGF 2010»
13 years 9 months ago
Visibility Editing For All-Frequency Shadow Design
We present an approach for editing shadows in all-frequency lighting environments. To support artistic control, we propose to decouple shadowing from lighting and focus on providi...
Juraj Obert, Fabio Pellacini, Sumanta N. Pattanaik
DCG
2002
71views more  DCG 2002»
13 years 8 months ago
A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron
The volume of the n-dimensional polytope nx := fy 2 Rn : yi 0 and y1 + + yi x1 + + xi for all 1 i ng for arbitrary x := x1; : : : ; xn with xi 0 for all i de nes a polyn...
Richard P. Stanley, Jim Pitman
MOC
2002
131views more  MOC 2002»
13 years 8 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 7 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan
TCOM
2010
106views more  TCOM 2010»
13 years 7 months ago
Achievable information rates for channels with insertions, deletions, and intersymbol interference with i.i.d. inputs
—We propose to use various trellis structures to characterize different types of insertion and deletion channels. We start with binary independent and identically distributed (i....
Jun Hu, Tolga M. Duman, M. Fatih Erden, Aleksandar...