Sciweavers

11213 search results - page 405 / 2243
» Low-contention data structures
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 7 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
298
Voted
AFPAC
2000
Springer
341views Mathematics» more  AFPAC 2000»
15 years 11 months ago
An Associative Perception-Action Structure Using a Localized Space Variant Information Representation
Abstract. Most of the processing in vision today uses spatially invariant operations. This gives efficient and compact computing structures, with the conventional convenient separa...
Gösta H. Granlund
UAI
2000
15 years 8 months ago
Being Bayesian about Network Structure
In many domains, we are interested in analyzing the structure of the underlying distribution, e.g., whether one variable is a direct parent of the other. Bayesian model selection a...
Nir Friedman, Daphne Koller
ISCI
2008
108views more  ISCI 2008»
15 years 6 months ago
Modeling and manipulating the structure of hierarchical schemas for the web
The Semantic Web is the next step of the current Web where information will become more machine-understandable to support effective data discovery and integration. Hierarchical sc...
Theodore Dalamagas, Alexandra Meliou, Timos K. Sel...
ECCV
2004
Springer
16 years 8 months ago
A Robust Algorithm for Characterizing Anisotropic Local Structures
This paper proposes a robust estimation and validation framework for characterizing local structures in a positive multi-variate continuous function approximated by a Gaussian-base...
Kazunori Okada, Dorin Comaniciu, Navneet Dalal, Ar...