Sciweavers

1022 search results - page 56 / 205
» Logspace Complexity of Functions and Structures
Sort
View
131
Voted
IWSEC
2009
Springer
15 years 7 months ago
Impossible Boomerang Attack for Block Cipher Structures
Impossible boomerang attack [5] (IBA) is a new variant of differential cryptanalysis against block ciphers. Evident from its name, it combines the ideas of both impossible differ...
Jiali Choy, Huihui Yap
ICCV
2007
IEEE
15 years 7 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...
109
Voted
ADC
2006
Springer
158views Database» more  ADC 2006»
15 years 6 months ago
Dimensionality reduction in patch-signature based protein structure matching
Searching bio-chemical structures is becoming an important application domain of information retrieval. This paper introduces a protein structure matching problem and formulates i...
Zi Huang, Xiaofang Zhou, Dawei Song, Peter Bruza
ISCAPDCS
2003
15 years 2 months ago
Parallel Relative Debugging with Dynamic Data Structures
This paper discusses the use of “relative debugging” as a technique for locating errors in a program that has been ported or developed using evolutionary software engineering ...
David Abramson, Raphael A. Finkel, Donny Kurniawan...
119
Voted
ICML
2005
IEEE
16 years 1 months ago
Predicting protein folds with structural repeats using a chain graph model
Protein fold recognition is a key step towards inferring the tertiary structures from amino-acid sequences. Complex folds such as those consisting of interacting structural repeat...
Yan Liu, Eric P. Xing, Jaime G. Carbonell