Sciweavers

460 search results - page 61 / 92
» A Comparison of Functional and Structural Partitioning
Sort
View
ASIACRYPT
2000
Springer
14 years 1 months ago
On the Pseudorandomness of Top-Level Schemes of Block Ciphers
Block ciphers are usually based on one top-level scheme into which we plug “round functions”. To analyze security, it is important to study the intrinsic security provided by t...
Shiho Moriai, Serge Vaudenay
SIGGRAPH
1989
ACM
14 years 29 days ago
Ray tracing deterministic 3-D fractals
As shown in 1982, Julia sets of quadratic functions as well as many other deterministic fractals exist in spaces of higher dimensionality than the complex plane. Originally a boun...
John C. Hart, Daniel J. Sandin, Louis H. Kauffman
DAGM
2008
Springer
13 years 10 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr
INFSOF
2007
101views more  INFSOF 2007»
13 years 8 months ago
Clustering large software systems at multiple layers
Software clustering algorithms presented in the literature rarely incorporate in the clustering process dynamic information, such as the number of function invocations during runt...
Bill Andreopoulos, Aijun An, Vassilios Tzerpos, Xi...
CORR
2004
Springer
110views Education» more  CORR 2004»
13 years 8 months ago
Shannon Information and Kolmogorov Complexity
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
Peter Grünwald, Paul M. B. Vitányi