Sciweavers

1957 search results - page 111 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
ECCV
2008
Springer
15 years 11 months ago
Solving Image Registration Problems Using Interior Point Methods
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
Camillo J. Taylor, Arvind Bhusnurmath
CVPR
2011
IEEE
14 years 5 months ago
Submodularity beyond submodular energies: coupling edges in graph cuts
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an ef...
Stefanie Jegelka, Jeff Bilmes
SENSYS
2006
ACM
15 years 3 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
BMCBI
2010
158views more  BMCBI 2010»
14 years 10 months ago
Validation of differential gene expression algorithms: Application comparing fold-change estimation to hypothesis testing
Background: Sustained research on the problem of determining which genes are differentially expressed on the basis of microarray data has yielded a plethora of statistical algorit...
Corey M. Yanofsky, David R. Bickel
IDA
2011
Springer
14 years 4 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...