Sciweavers

56 search results - page 11 / 12
» Improving the Locality Properties of Binary Representations
Sort
View
BMCBI
2007
128views more  BMCBI 2007»
13 years 7 months ago
A robust and efficient algorithm for the shape description of protein structures and its application in predicting ligand bindin
Background: An accurate description of protein shape derived from protein structure is necessary to establish an understanding of protein-ligand interactions, which in turn will l...
Lei Xie, Philip E. Bourne
POPL
2008
ACM
14 years 7 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...
BMCBI
2008
170views more  BMCBI 2008»
13 years 7 months ago
A genetic approach for building different alphabets for peptide and protein classification
Background: In this paper, it is proposed an optimization approach for producing reduced alphabets for peptide classification, using a Genetic Algorithm. The classification task i...
Loris Nanni, Alessandra Lumini
AAAI
1994
13 years 8 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
CONEXT
2009
ACM
13 years 8 months ago
Exploiting dynamicity in graph-based traffic analysis: techniques and applications
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...
Marios Iliofotou, Michalis Faloutsos, Michael Mitz...