Sciweavers

373 search results - page 49 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
FOCS
2002
IEEE
14 years 28 days ago
Low-Dimensional Linear Programming with Violations
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
Timothy M. Chan
ICPR
2000
IEEE
13 years 11 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
BMCBI
2006
198views more  BMCBI 2006»
13 years 8 months ago
Gene selection and classification of microarray data using random forest
Background: Selection of relevant genes for sample classification is a common task in most gene expression studies, where researchers try to identify the smallest possible set of ...
Ramón Díaz-Uriarte, Sara Alvarez de ...
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 8 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
13 years 8 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang