Sciweavers

1073 search results - page 123 / 215
» Formal Program Development with Approximations
Sort
View
IJON
2008
98views more  IJON 2008»
13 years 9 months ago
Factorisation and denoising of 0-1 data: A variational approach
Presence-absence (0-1) observations are special in that often the absence of evidence is not evidence of absence. Here we develop an independent factor model, which has the unique...
Ata Kabán, Ella Bingham
TVCG
2010
174views more  TVCG 2010»
13 years 7 months ago
Subdivision Analysis of the Trilinear Interpolant
— Isosurfaces are fundamental volumetric visualization tools, and are generated by the well-known Marching Cubes cases that approximate contours of trilinearly-interpolated scala...
Hamish Carr, Nelson Max
RECOMB
2005
Springer
14 years 9 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
JMLR
2012
11 years 11 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski
PASTE
2004
ACM
14 years 2 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick