Sciweavers

2412 search results - page 261 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
126
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
Dynamic packet fragmentation for wireless channels with failures
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
Predrag R. Jelenkovic, Jian Tan
121
Voted
WDAG
2007
Springer
73views Algorithms» more  WDAG 2007»
15 years 9 months ago
On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
Consider a distributed network of n nodes that is connected to a global source of “beats”. All nodes receive the “beats” simultaneously, and operate in lock-step. A scheme ...
Danny Dolev, Ezra N. Hoch
163
Voted
BMCBI
2010
161views more  BMCBI 2010»
15 years 3 months ago
GATExplorer: Genomic and Transcriptomic Explorer; mapping expression probes to gene loci, transcripts, exons and ncRNAs
Background: Genome-wide expression studies have developed exponentially in recent years as a result of extensive use of microarray technology. However, expression signals are typi...
Alberto Risueño, Celia Fontanillo, Marcel E...
143
Voted
QRE
2008
140views more  QRE 2008»
15 years 3 months ago
Discrete mixtures of kernels for Kriging-based optimization
: Kriging-based exploration strategies often rely on a single Ordinary Kriging model which parametric covariance kernel is selected a priori or on the basis of an initial data set....
David Ginsbourger, Céline Helbert, Laurent ...
139
Voted
CORR
2010
Springer
164views Education» more  CORR 2010»
15 years 2 months ago
Is submodularity testable?
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
C. Seshadhri, Jan Vondrák