Sciweavers

172 search results - page 15 / 35
» Improving the Time Complexity of Matsui's Linear Cryptanalys...
Sort
View
CAD
2006
Springer
15 years 6 months ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin
GPEM
2007
119views more  GPEM 2007»
15 years 6 months ago
Genomic mining for complex disease traits with "random chemistry"
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
Margaret J. Eppstein, Joshua L. Payne, Bill C. Whi...
DAM
1999
100views more  DAM 1999»
15 years 5 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
COMPGEOM
2010
ACM
15 years 11 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
BMCBI
2008
123views more  BMCBI 2008»
15 years 6 months ago
A tree-based conservation scoring method for short linear motifs in multiple alignments of protein sequences
Background: The structure of many eukaryotic cell regulatory proteins is highly modular. They are assembled from globular domains, segments of natively disordered polypeptides and...
Claudia Chica, Alberto Labarga, Cathryn M. Gould, ...