Sciweavers

13603 search results - page 2371 / 2721
» On the Complexity of Computing Treelength
Sort
View
FSE
2008
Springer
162views Cryptology» more  FSE 2008»
15 years 8 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 8 months ago
Search-Based Path Planning with Homotopy Class Constraints
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
Subhrajit Bhattacharya
BIOCOMP
2007
15 years 8 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
BIOCOMP
2008
15 years 8 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
208
Voted
DAGSTUHL
2010
15 years 8 months ago
Tracking Lines in Higher Order Tensor Fields
While tensors occur in many areas of science and engineering, little has been done to visualize tensors with order higher than two. Tensors of higher orders can be used for exampl...
Mario Hlawitschka, Gerik Scheuermann
« Prev « First page 2371 / 2721 Last » Next »