Sciweavers

11017 search results - page 1 / 2204
» Closure Systems and their Structure
Sort
View
RELMICS
2000
Springer
13 years 8 months ago
Closure Systems and their Structure
Robert E. Jamison, John L. Pfaltz
JDA
2006
184views more  JDA 2006»
13 years 4 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
JCC
2006
110views more  JCC 2006»
13 years 4 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs
ICDT
2010
ACM
180views Database» more  ICDT 2010»
13 years 8 months ago
Composing local-as-view mappings: closure and applications
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia C. Arocena, Ariel Fuxman, Renée J....
IEEEICCI
2007
IEEE
13 years 11 months ago
A Logic Language of Granular Computing
Granular computing concerns human thinking and problem solving, as well as their implications to the design of knowledge intensive systems. It simplifies complex real world probl...
Yiyu Yao, Bing Zhou