Sciweavers

2107 search results - page 385 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
CATA
2000
13 years 10 months ago
Fast connected component labeling algorithm using a divide and conquer technique
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
June-Me Park, Carl G. Looney, Hui-Chuan Chen
BMCBI
2007
176views more  BMCBI 2007»
13 years 9 months ago
Genome Expression Pathway Analysis Tool - Analysis and visualization of microarray gene expression data under genomic, proteomic
Background: Regulation of gene expression is relevant to many areas of biology and medicine, in the study of treatments, diseases, and developmental stages. Microarrays can be use...
Markus Weniger, Julia C. Engelmann, Jörg Schu...
BMCBI
2011
13 years 14 days ago
FFCA: a feasibility-based method for flux coupling analysis of metabolic networks
Background: Flux coupling analysis (FCA) is a useful method for finding dependencies between fluxes of a metabolic network at steady-state. FCA classifies reactions into subsets (...
László Dávid, Sayed-Amir Mara...
ECCV
2010
Springer
14 years 2 months ago
The Quadratic-Chi Histogram Distance Family
We present a new histogram distance family, the Quadratic-Chi (QC). QC members are Quadratic-Form distances with a cross-bin χ2 -like normalization. The cross-bin χ2 -like normal...
IANDC
2008
141views more  IANDC 2008»
13 years 9 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...