Sciweavers

330 search results - page 11 / 66
» Effective Complexity and its Relation to Logical Depth
Sort
View
DBPL
1995
Springer
106views Database» more  DBPL 1995»
13 years 11 months ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
CNSR
2007
IEEE
101views Communications» more  CNSR 2007»
14 years 2 months ago
The Theory of Natural Movement and its Application to the Simulation of Mobile Ad Hoc Networks (MANET)
The theory of natural movement is fundamental to space syntax: a set of theories and methods developed in the late 1970s that seeks, at a general level, to reveal the mutual effec...
Nick Sheep Dalton, Ruth Conroy Dalton
PODS
2010
ACM
197views Database» more  PODS 2010»
13 years 7 months ago
When data dependencies over SQL tables meet the logics of paradox and S-3
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
Sven Hartmann, Sebastian Link
ICALP
2009
Springer
14 years 7 days ago
Decidability of the Guarded Fragment with the Transitive Closure
We consider an extension of the guarded fragment in which one can guard quantiers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
Jakub Michaliszyn
BMCBI
2011
12 years 11 months ago
NeurphologyJ: an automatic neuronal morphology quantification method and its application in pharmacological discovery
Background: Automatic quantification of neuronal morphology from images of fluorescence microscopy plays an increasingly important role in high-content screenings. However, there ...
Shinn-Ying Ho, Chih-Yuan Chao, Hui-Ling Huang, Tza...