Sciweavers

15033 search results - page 2758 / 3007
» Complexity Theory and Algorithms
Sort
View
145
Voted
FSE
2008
Springer
162views Cryptology» more  FSE 2008»
15 years 6 months ago
Collisions on SHA-0 in One Hour
At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applie...
Stéphane Manuel, Thomas Peyrin
AAAI
2010
15 years 6 months ago
Evolving Compiler Heuristics to Manage Communication and Contention
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents...
Matthew E. Taylor, Katherine E. Coons, Behnam Roba...
AAAI
2010
15 years 6 months ago
Decision-Theoretic Control of Crowd-Sourced Workflows
Crowd-sourcing is a recent framework in which human intelligence tasks are outsourced to a crowd of unknown people ("workers") as an open call (e.g., on Amazon's Me...
Peng Dai, Mausam, Daniel S. Weld
BIOCOMP
2007
15 years 6 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci
136
Voted
BIOCOMP
2008
15 years 6 months ago
Identifying Protein Flexibility by NMA
- Here proposed apriori method for identification of protein flexibility relies on one end-state conformation of the protein. This method has comparative advantage over many others...
Kresimir Sikic, Branko Jeren, Sanja Tomic
« Prev « First page 2758 / 3007 Last » Next »