Sciweavers

4128 search results - page 413 / 826
» Learning and using relational theories
Sort
View
LMCS
2006
79views more  LMCS 2006»
15 years 6 months ago
Computably Based Locally Compact Spaces
tract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same...
Paul Taylor 0002
CIBCB
2008
IEEE
16 years 1 months ago
Temporal and structural analysis of biological networks in combination with microarray data
— We introduce a graph-based relational learning approach using graph-rewriting rules for temporal and structural analysis of biological networks changing over time. The analysis...
Chang Hun You, Lawrence B. Holder, Diane J. Cook
COLT
2006
Springer
15 years 8 months ago
Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
Manfred K. Warmuth
JCC
2002
127views more  JCC 2002»
15 years 6 months ago
Effective Born radii in the generalized Born approximation: The importance of being perfect
: Generalized Born (GB) models provide, for many applications, an accurate and computationally facile estimate of the electrostatic contribution to aqueous solvation. The GB models...
Alexey Onufriev, David A. Case, Donald Bashford
PSD
2004
Springer
108views Database» more  PSD 2004»
16 years 7 days ago
Developing Adoptable Disclosure Protection Techniques: Lessons Learned from a U.S. Experience
The development of new disclosure protection techniques is useful only insofar as those techniques are adopted by statistical agencies. In order for technical experts in disclosure...
Nicholas H. Greenia