Sciweavers

16666 search results - page 2846 / 3334
» Descriptive and Computational Complexity
Sort
View
SAMOS
2005
Springer
16 years 13 days ago
Modeling NoC Architectures by Means of Deterministic and Stochastic Petri Nets
The design of appropriate communication architectures for complex Systems-on-Chip (SoC) is a challenging task. One promising alternative to solve these problems are Networks-on-Chi...
Holger Blume, Thorsten von Sydow, Daniel Becker, T...
VLDB
2005
ACM
118views Database» more  VLDB 2005»
16 years 13 days ago
Mining Compressed Frequent-Pattern Sets
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
WABI
2005
Springer
16 years 13 days ago
Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds
d Abstract] Tamir Tuller , Efrat Oron , Erez Makavy , Daniel A. Chamovitz † , and Benny Chor ‡ Tel-Aviv University, Tel-Aviv 69978, Israel. Abstract. We study gene expression d...
Tamir Tuller, Efrat Oron, Erez Makavy, Daniel A. C...
WABI
2005
Springer
143views Bioinformatics» more  WABI 2005»
16 years 13 days ago
A Faster Algorithm for Detecting Network Motifs
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
Sebastian Wernicke
WINE
2005
Springer
122views Economy» more  WINE 2005»
16 years 12 days ago
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
Ning Chen, Atri Rudra
« Prev « First page 2846 / 3334 Last » Next »