Sciweavers

6368 search results - page 223 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
208
Voted
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 11 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
MICCAI
2005
Springer
16 years 7 months ago
A Physical Model for DT-MRI Based Connectivity Map Computation
In this study we address the problem of extracting a robust connectivity metric for brain white matter. We defined the connectivity problem as an energy minimization task, by assoc...
Burak Acar, Erdem Yörük, Roland Bammer
SIGMOD
2006
ACM
158views Database» more  SIGMOD 2006»
16 years 7 months ago
Continuous query processing in data streams using duality of data and queries
Recent data stream systems such as TelegraphCQ have employed the well-known property of duality between data and queries. In these systems, query processing methods are classified...
Hyo-Sang Lim, Jae-Gil Lee, Min-Jae Lee, Kyu-Young ...
FLAIRS
2007
15 years 9 months ago
An Extended Neural Gas Model for Efficient Data Mining Tasks
This paper presents a numerical association rule extraction method that is based on original quality measures which evaluate to what extent a numerical classification model behave...
Jean-Charles Lamirel, Shadi Al Shehabi
BMCBI
2010
105views more  BMCBI 2010»
15 years 7 months ago
A knowledge-guided strategy for improving the accuracy of scoring functions in binding affinity prediction
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
Tiejun Cheng, Zhihai Liu, Renxiao Wang