Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions Fulltext Access 21 Pages 2010
Exact optimal inference in regression models under heteroskedasticity and non-normality of unknown form Fulltext Access 22 Pages 2010
Efficient parallelisation of Metropolis–Hastings algorithms using a prefetching approach Fulltext Access 22 Pages 2010
Multifunctional software systems: Structured modeling and specification of functional requirements Fulltext Access 22 Pages 2010
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs Fulltext Access 22 Pages 2010
Formal Specification of Correlation in WS Orchestrations Using BP-calculus Fulltext Access 22 Pages 2010
An efficient algorithm for the stratification and triangulation of an algebraic surface Fulltext Access 22 Pages 2010
Positive approximation: An accelerator for attribute reduction in rough set theory Fulltext Access 22 Pages 2010
Planning to see: A hierarchical approach to planning visual actions on a robot using POMDPs Fulltext Access 22 Pages 2010
Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures Fulltext Access 22 Pages 2010
Optimized algorithms for predictive range and KNN queries on moving objects Fulltext Access 22 Pages 2010
A novel analysis space for pointer analysis and its application for bug finding Fulltext Access 22 Pages 2010
Automated analysis of feature models 20 years later: A literature review Fulltext Access 22 Pages 2010
Decision-making coordination and efficient reasoning techniques for feature-based configuration Fulltext Access 22 Pages 2010
Towards a unified approach to encodability and separation results for process calculi Fulltext Access 23 Pages 2010
Practical performance models of algorithms in evolutionary program induction and other domains Fulltext Access 23 Pages 2010
Trajectory databases: Data models, uncertainty and complete query languages Fulltext Access 23 Pages 2010
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps Fulltext Access 23 Pages 2010
On the complexities of consistency checking for restricted UML class diagrams Fulltext Access 23 Pages 2010
A type-centric framework for specifying heterogeneous, large-scale, component-oriented, architectures Fulltext Access 23 Pages 2010
MOQA; unlocking the potential of compositional static average-case analysis Fulltext Access 23 Pages 2010
A formalisation of the copy-modify-merge approach to version control in MDE Fulltext Access 23 Pages 2010
On the evaluation of gridification effort and runtime aspects of JGRIM applications Fulltext Access 23 Pages 2010
Arrangement of multi-dimensional scalable video data for heterogeneous clients Fulltext Access 23 Pages 2010
Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependencies Fulltext Access 23 Pages 2010
Modeling and mining of dynamic trust in complex service-oriented systems Fulltext Access 23 Pages 2010
Approximate algorithms with generalizing attribute values for k-anonymity Fulltext Access 23 Pages 2010
Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms Fulltext Access 23 Pages 2010
Nonparametric multiplicative bias correction for kernel-type density estimation on the unit interval Fulltext Access 23 Pages 2010
Analysis of a probabilistic model of redundancy in unsupervised information extraction Fulltext Access 23 Pages 2010
Understanding the scalability of Bayesian network inference using clique tree growth curves Fulltext Access 23 Pages 2010
Continuous reverse k nearest neighbor monitoring on moving objects in road networks Fulltext Access 24 Pages 2010
Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL Fulltext Access 24 Pages 2010
A Virtual Machine for Supporting Reversible Probabilistic Guarded Command Languages Fulltext Access 24 Pages 2010
Toward dynamic and attribute based publication, discovery and selection for cloud computing Fulltext Access 24 Pages 2010
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes Fulltext Access 25 Pages 2010
Regaining cut admissibility in deduction modulo using abstract completion Fulltext Access 25 Pages 2010
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules Fulltext Access 25 Pages 2010