Sciweavers

528 search results - page 94 / 106
» Degrees of categoricity of computable structures
Sort
View
AI
2010
Springer
13 years 8 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
COMPGEOM
2010
ACM
14 years 1 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
CG
2006
Springer
13 years 8 months ago
Realtime automatic selection of good molecular views
The investigation of molecular structures often requires the use of graphics software to display different representations of the molecule of interest. Unfortunately, the commonly...
Pere-Pau Vázquez, Miquel Feixas, Mateu Sber...
IFM
2007
Springer
129views Formal Methods» more  IFM 2007»
14 years 2 months ago
Slotted-Circus
Material Flow Abstraction of Manufacturing Systems. ‣Umberto Costa, Ivan de Medeiros Jr and Marcel Oliveira. Specification and Verification of a MPI Implementation for a MP-SoC...
Andrew Butterfield, Adnan Sherif, Jim Woodcock
SAC
2004
ACM
14 years 2 months ago
A cost-oriented approach for infrastructural design
The selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of fre...
Danilo Ardagna, Chiara Francalanci, Marco Trubian