Sciweavers

9871 search results - page 352 / 1975
» On the Structure of Low Sets
Sort
View
JACM
2000
81views more  JACM 2000»
15 years 6 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
KDD
1994
ACM
117views Data Mining» more  KDD 1994»
15 years 11 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
RECOMB
2007
Springer
16 years 7 months ago
Free Energy Estimates of All-Atom Protein Structures Using Generalized Belief Propagation
We present a technique for approximating the free energy of protein structures using Generalized Belief Propagation (GBP). The accuracy and utility of these estimates are then demo...
Hetunandan Kamisetty, Eric P. Xing, Christopher Ja...
TLDI
2005
ACM
135views Formal Methods» more  TLDI 2005»
16 years 9 days ago
Types for describing coordinated data structures
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
Michael F. Ringenburg, Dan Grossman
COMPGEOM
2010
ACM
15 years 12 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park