Sciweavers

115 search results - page 9 / 23
» Generating All Sets With Bounded Unions
Sort
View
CCS
2006
ACM
13 years 11 months ago
Finding the original point set hidden among chaff
In biometric identification, a fingerprint is typically represented as a set of minutiae which are 2D points. A method [4] to protect the fingerprint template hides the minutiae b...
Ee-Chien Chang, Ren Shen, Francis Weijian Teo
NETWORKING
2007
13 years 9 months ago
On the Resilient Overlay Topology Formation in Multi-hop Wireless Networks
In this paper, we study the problem of how to design overlay topologies in multi-hop wireless networks such that the overlays achieve perfect resilience, in terms of all cooperativ...
Fei Xing, Wenye Wang
MOBIHOC
2008
ACM
14 years 7 months ago
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
Christian Scheideler, Andréa W. Richa, Paol...
VISUALIZATION
1998
IEEE
13 years 11 months ago
Interpolation of triangle hierarchies
We consider interpolation between keyframe hierarchies. We impose a set of weak constraints that allows smooth interpolation between two keyframe hierarchies in an animation or, m...
Axel Friedrich, Konrad Polthier, Markus Schmies
CORR
2007
Springer
95views Education» more  CORR 2007»
13 years 7 months ago
A Note on the Periodicity and the Output Rate of Bit Search Type Generators
We investigate the bit-search type irregular decimation algorithms that are used within LFSR-based stream ciphers. In particular, we concentrate on BSG and ABSG, and consider two ...
Yucel Altug, N. Polat Ayerden, Mehmet Kivanç...