Sciweavers

1071 search results - page 101 / 215
» Programming with enumerable sets of structures
Sort
View
PPOPP
1997
ACM
15 years 7 months ago
Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
Martin C. Rinard
KDD
1994
ACM
117views Data Mining» more  KDD 1994»
15 years 7 months ago
Application of the TETRAD II Program to the Study of Student Retention in U.S. Colleges
We applied TETRAD II, a causal discovery program developed in Carnegie Mellon University's Department of Philosophy, to a database containing information on 204 U.S. colleges...
Marek J. Druzdze, Clark Glymour
ISMB
1996
15 years 4 months ago
Refining Neural Network Predictions for Helical Transmembrane Proteins by Dynamic Programming
For transmembrane proteins experimental determina-tion of three-dimensional structure is problematic. However, membrane proteins have important impact for molecular biology in gen...
Burkhard Rost, Rita Casadio, Piero Fariselli
CPAIOR
2009
Springer
15 years 9 months ago
Backdoors to Combinatorial Optimization: Feasibility and Optimality
There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient al...
Bistra N. Dilkina, Carla P. Gomes, Yuri Malitsky, ...
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
16 years 3 months ago
CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
Ihab F. Ilyas, Volker Markl, Peter J. Haas, Paul B...