Sciweavers

46 search results - page 6 / 10
» The Elimination Procedure for the Phylogeny Number
Sort
View
AAAI
2010
13 years 9 months ago
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
Emma Rollon, Rina Dechter
CASES
2007
ACM
13 years 11 months ago
An optimistic and conservative register assignment heuristic for chordal graphs
This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC...
Philip Brisk, Ajay K. Verma, Paolo Ienne
ICCV
2003
IEEE
14 years 9 months ago
Mean Shift Based Clustering in High Dimensions: A Texture Classification Example
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
Bogdan Georgescu, Ilan Shimshoni, Peter Meer
BMCBI
2005
126views more  BMCBI 2005»
13 years 7 months ago
An algorithm for automatic evaluation of the spot quality in two-color DNA microarray experiments
Background: Although DNA microarray technologies are very powerful for the simultaneous quantitative characterization of thousands of genes, the quality of the obtained experiment...
Eugene Novikov, Emmanuel Barillot
TRIER
2002
13 years 7 months ago
Precise Interprocedural Dependence Analysis of Parallel Programs
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
Markus Müller-Olm