2200 search results - page 90 / 440 » Bloch's Constant is Computable |
C5
2007
IEEE
15 years 4 months ago
2007
IEEE
3D virtual environments like Croquet need to be attractive in order to be visited and used. Their attractiveness depends on the level of vitality that the user is able to experien...
ESORICS
2007
Springer
15 years 4 months ago
2007
Springer
The problem of key management in access hierarchies studies ways to assign keys to users and classes such that each user, after receiving her secret key(s), is able to independentl...
PKC
2005
Springer
15 years 3 months ago
2005
Springer
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
ECCV
2010
Springer
15 years 3 months ago
2010
Springer
Motion blurs confound many computer vision problems. The fluttered shutter (FS) camera [1] tackles the motion deblurring problem by emulating invertible broadband blur kernels. How...
FOCS
2002
IEEE
15 years 3 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...