Sciweavers

3514 search results - page 506 / 703
» A search space
Sort
View
208
Voted
ECOOP
2009
Springer
16 years 1 months ago
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
Guoqing Xu, Atanas Rountev, Manu Sridharan
CP
2009
Springer
16 years 1 months ago
Filtering Numerical CSPs Using Well-Constrained Subsystems
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...
Ignacio Araya, Gilles Trombettoni, Bertrand Neveu
102
Voted
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 1 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
KDD
2006
ACM
228views Data Mining» more  KDD 2006»
16 years 1 months ago
Algorithms for time series knowledge mining
Temporal patterns composed of symbolic intervals are commonly formulated with Allen's interval relations originating in temporal reasoning. This representation has severe dis...
Fabian Mörchen
93
Voted
RECOMB
2002
Springer
16 years 1 months ago
A dimensionality reduction approach to modeling protein flexibility
Proteins are involved either directly or indirectly in all biological processes in living organisms. It is now widely accepted that conformational changes of proteins can critical...
Miguel L. Teodoro, George N. Phillips, Lydia E. Ka...