Sciweavers

5100 search results - page 184 / 1020
» The Linear Complexity of a Graph
Sort
View
BMCBI
2007
202views more  BMCBI 2007»
13 years 10 months ago
ProtNet: a tool for stochastic simulations of protein interaction networks dynamics
Background: Protein interactions support cell organization and mediate its response to any specific stimulus. Recent technological advances have produced large data-sets that aim ...
Massimo Bernaschi, Filippo Castiglione, Alessandra...
DCC
2008
IEEE
14 years 10 months ago
Probabilistic algorithm for finding roots of linearized polynomials
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
Vitaly Skachek, Ron M. Roth
PRL
2002
69views more  PRL 2002»
13 years 10 months ago
Variant code transformations for linear quadtrees
In this paper, general guidelines and specific algorithms for code transformations between breadth-first (BF) and depth-first (DF) linear quadtrees are proposed. Each algorithm ha...
Pei-Min Chen
ICPR
2008
IEEE
14 years 5 months ago
Linear representation of discrete surfaces in 3D
A method to compute a linear medial representation of a complex surface in the 3D discrete space is presented. The method involves voxel classification, surface labeling, anchor p...
Carlo Arcelli, Gabriella Sanniti di Baja, Luca Ser...
MLQ
2007
108views more  MLQ 2007»
13 years 10 months ago
Coloring linear orders with Rado's partial order
Let R be the preorder of embeddability between countable linear orders colored with elements of Rado’s partial order (a standard example of a wqo which is not a bqo). We show tha...
Riccardo Camerlo, Alberto Marcone