Sciweavers

2412 search results - page 290 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
138
Voted
BMCBI
2005
109views more  BMCBI 2005»
15 years 3 months ago
Automation of gene assignments to metabolic pathways using high-throughput expression data
Background: Accurate assignment of genes to pathways is essential in order to understand the functional role of genes and to map the existing pathways in a given genome. Existing ...
Liviu Popescu, Golan Yona
115
Voted
COCOON
2007
Springer
15 years 9 months ago
The Informational Content of Canonical Disjoint NP-Pairs
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between the...
Christian Glaßer, Alan L. Selman, Liyu Zhang
120
Voted
SIGGRAPH
2010
ACM
15 years 8 months ago
Paneling architectural freeform surfaces
The emergence of large-scale freeform shapes in architecture poses big challenges to the fabrication of such structures. A key problem is the approximation of the design surface b...
Michael Eigensatz, Martin Kilian, Alexander Schift...
169
Voted
SCP
2000
119views more  SCP 2000»
15 years 3 months ago
Automated compositional Markov chain generation for a plain-old telephone system
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
Holger Hermanns, Joost-Pieter Katoen
171
Voted
ICDE
2012
IEEE
216views Database» more  ICDE 2012»
13 years 6 months ago
Load Balancing in MapReduce Based on Scalable Cardinality Estimates
—MapReduce has emerged as a popular tool for distributed and scalable processing of massive data sets and is increasingly being used in e-science applications. Unfortunately, the...
Benjamin Gufler, Nikolaus Augsten, Angelika Reiser...