Sciweavers

3204 search results - page 587 / 641
» The Alcuin Number of a Graph
Sort
View
121
Voted
DM
2006
128views more  DM 2006»
15 years 16 days ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
122
Voted
JSA
2007
191views more  JSA 2007»
15 years 12 days ago
Automated memory-aware application distribution for Multi-processor System-on-Chips
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....
BMCBI
2004
150views more  BMCBI 2004»
15 years 11 days ago
Graph-based iterative Group Analysis enhances microarray interpretation
Background: One of the most time-consuming tasks after performing a gene expression experiment is the biological interpretation of the results by identifying physiologically impor...
Rainer Breitling, Anna Amtmann, Pawel Herzyk
131
Voted
CCR
2002
130views more  CCR 2002»
15 years 10 days ago
Network topologies, power laws, and hierarchy
It has long been thought that the Internet, and its constituent networks, are hierarchical in nature. Consequently, the network topology generators most widely used by the Interne...
Hongsuda Tangmunarunkit, Ramesh Govindan, Sugih Ja...
109
Voted
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
15 years 1 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...