Sciweavers

1529 search results - page 97 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
ASIACRYPT
2009
Springer
15 years 10 months ago
Linearization Framework for Collision Attacks: Application to CubeHash and MD6
In this paper, an improved differential cryptanalysis framework for finding collisions in hash functions is provided. Its principle is based on linearization of compression functi...
Eric Brier, Shahram Khazaei, Willi Meier, Thomas P...
ICML
2006
IEEE
16 years 4 months ago
Optimal kernel selection in Kernel Fisher discriminant analysis
In Kernel Fisher discriminant analysis (KFDA), we carry out Fisher linear discriminant analysis in a high dimensional feature space defined implicitly by a kernel. The performance...
Seung-Jean Kim, Alessandro Magnani, Stephen P. Boy...
RT
1995
Springer
15 years 7 months ago
The Role of Functional Analysis in Global Illumination
Abstract: The problem of global illumination is virtually synonymouswith solving the rendering equation. Although a great deal of research has been directed toward Monte Carlo and ...
James Arvo
JACM
2010
116views more  JACM 2010»
15 years 2 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
AAAI
2006
15 years 5 months ago
Extending Dynamic Backtracking to Solve Weighted Conditional CSPs
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
Robert T. Effinger, Brian C. Williams