Sciweavers

2680 search results - page 98 / 536
» The topology of the independence complex
Sort
View
ECCC
2011
202views ECommerce» more  ECCC 2011»
14 years 8 months ago
New strong direct product results in communication complexity
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
Rahul Jain
BMCBI
2005
156views more  BMCBI 2005»
15 years 1 months ago
A new dynamical layout algorithm for complex biochemical reaction networks
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
Katja Wegner, Ursula Kummer
FOCS
2007
IEEE
15 years 7 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
GECCO
2009
Springer
159views Optimization» more  GECCO 2009»
15 years 5 months ago
Bayesian network structure learning using cooperative coevolution
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
Olivier Barrière, Evelyne Lutton, Pierre-He...
SIGCOMM
2006
ACM
15 years 7 months ago
Building an AS-topology model that captures route diversity
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...
Wolfgang Mühlbauer, Anja Feldmann, Olaf Maenn...