Sciweavers

596 search results - page 93 / 120
» Complexity Analysis by Graph Rewriting
Sort
View
DSD
2009
IEEE
105views Hardware» more  DSD 2009»
14 years 2 months ago
Design of a Highly Dependable Beamforming Chip
—As CMOS process technology advances towards 32nm, SoC complexity continuously grows but its dependability significantly decreases. In this paper, a beamforming chip 1 is designe...
Xiao Zhang, Hans G. Kerkhoff
HT
2009
ACM
14 years 2 months ago
Hyperincident connected components of tagging networks
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
Nicolas Neubauer, Klaus Obermayer
MOZ
2004
Springer
14 years 1 months ago
A Mozart Implementation of CP(BioNet)
The analysis of biochemical networks consists in studying the interactions between biological entities cooperating in complex cellular processes. To facilitate the expression of an...
Grégoire Dooms, Yves Deville, Pierre Dupont
RECOMB
1999
Springer
14 years 11 days ago
Evolution of metabolisms: a new method for the comparison of metabolic pathways
The abundance of information provided by completely sequenced genomes de nes a starting point for new insights in the multilevel organization of organisms and their evolution. At ...
Christian V. Forst, Klaus Schulten
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
13 years 10 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz