Sciweavers

1201 search results - page 34 / 241
» Linear Probing and Graphs
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 10 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
WG
2010
Springer
13 years 7 months ago
From Path Graphs to Directed Path Graphs
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
Steven Chaplick, Marisa Gutierrez, Benjamin L&eacu...
ENDM
2008
90views more  ENDM 2008»
13 years 10 months ago
On cliques of Helly Circular-arc Graphs
A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of a...
Min Chih Lin, Ross M. McConnell, Francisco J. Soul...
WEA
2009
Springer
126views Algorithms» more  WEA 2009»
14 years 4 months ago
Measuring the Similarity of Geometric Graphs
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, ...
BMCBI
2007
176views more  BMCBI 2007»
13 years 10 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...