Sciweavers

948 search results - page 125 / 190
» What can we achieve by arbitrary announcements
Sort
View
ACISP
2005
Springer
14 years 2 months ago
On the Possibility of Constructing Meaningful Hash Collisions for Public Keys
It is sometimes argued (as in [6]) that finding meaningful hash collisions might prove difficult. We show that at least one of the arguments involved is wrong, by showing that for...
Arjen K. Lenstra, Benne de Weger
IEEEARES
2010
IEEE
14 years 3 months ago
FedWare: Middleware Services to Cope with Information Consistency in Federated Identity Management
—Collaborations by the use of inter-organizational business processes can help companies to achieve a competitive edge over competing businesses. Typically, these collaborations ...
Thorsten Höllrigl, Jochen Dinger, Hannes Hart...
ISAAC
2007
Springer
102views Algorithms» more  ISAAC 2007»
14 years 3 months ago
Depth of Field and Cautious-Greedy Routing in Social Networks
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
David Barbella, George Kachergis, David Liben-Nowe...
CGF
2008
121views more  CGF 2008»
13 years 9 months ago
Tensor Clustering for Rendering Many-Light Animations
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...
Milos Hasan, Edgar Velázquez-Armendá...
ICCV
2005
IEEE
14 years 10 months ago
Fusion of Multi-View Silhouette Cues Using a Space Occupancy Grid
In this paper, we investigate what can be inferred from several silhouette probability maps, in multi-camera environments. To this aim, we propose a new framework for multi-view s...
Jean-Sébastien Franco, Edmond Boyer