Sciweavers

858 search results - page 100 / 172
» One Is Enough!
Sort
View
CRYPTO
2010
Springer
228views Cryptology» more  CRYPTO 2010»
13 years 11 months ago
On Generalized Feistel Networks
We prove beyond-birthday-bound security for most of the well-known types of generalized Feistel networks: (1) unbalanced Feistel networks, where the n-bit to m-bit round functions ...
Viet Tung Hoang, Phillip Rogaway
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
13 years 11 months ago
Towards memoryless model building
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
David Iclanzan, Dumitru Dumitrescu
AVSS
2007
IEEE
13 years 10 months ago
People tracking across two distant self-calibrated cameras
People tracking is of fundamental importance in multicamera surveillance systems. In recent years, many approaches for multi-camera tracking have been discussed. Most methods use ...
Roman P. Pflugfelder, Horst Bischof
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 10 months ago
Quasi-randomness of graph balanced cut properties
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
Hao Huang, Choongbum Lee
CORR
2008
Springer
99views Education» more  CORR 2008»
13 years 10 months ago
The meaning of concurrent programs
system during a single processor cycle. But we can abstract out properties of the sequences and focus on the properties of interest. The "specifications" given here are i...
Victor Yodaiken