Sciweavers

447 search results - page 8 / 90
» Bounded Model Checking with Parametric Data Structures
Sort
View
AAAI
2008
13 years 10 months ago
Multi-HDP: A Non Parametric Bayesian Model for Tensor Factorization
Matrix factorization algorithms are frequently used in the machine learning community to find low dimensional representations of data. We introduce a novel generative Bayesian pro...
Ian Porteous, Evgeniy Bart, Max Welling
SCP
2010
155views more  SCP 2010»
13 years 6 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
EMMCVPR
2003
Springer
14 years 25 days ago
Surface Recovery from 3D Point Data Using a Combined Parametric and Geometric Flow Approach
This paper presents a novel method for surface recovery from discrete 3D point data sets. In order to produce improved reconstruction results, the algorithm presented in this paper...
Peter Savadjiev, Frank P. Ferrie, Kaleem Siddiqi
SMA
2010
ACM
192views Solid Modeling» more  SMA 2010»
13 years 2 months ago
Infinitesimally Robust estimation in general smoothly parametrized models
Abstract The aim of the paper is to give a coherent account of the robustness approach based on shrinking neighborhoods in the case of i.i.d. observations, and add some theoretical...
Matthias Kohl, Peter Ruckdeschel, Helmut Rieder
ICALP
2003
Springer
14 years 25 days ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen