Sciweavers

290 search results - page 55 / 58
» The Intersection Probability and Its Properties
Sort
View
OA
1989
237views Algorithms» more  OA 1989»
15 years 3 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
BMCBI
2008
200views more  BMCBI 2008»
14 years 11 months ago
Defining functional distances over Gene Ontology
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
Angela del Pozo, Florencio Pazos, Alfonso Valencia
BMCBI
2005
113views more  BMCBI 2005»
14 years 11 months ago
PentaPlot: A software tool for the illustration of genome mosaicism
Background: Dekapentagonal maps depict the phylogenetic relationships of five genomes in a visually appealing diagram and can be viewed as an alternative to a single evolutionary ...
Lutz Hamel, Olga Zhaxybayeva, J. Peter Gogarten
IANDC
2010
84views more  IANDC 2010»
14 years 9 months ago
Underapproximation for model-checking based on universal circuits
For two naturals m, n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit deï...
Arie Matsliah, Ofer Strichman
SIAMCOMP
2010
147views more  SIAMCOMP 2010»
14 years 9 months ago
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...