Sciweavers

3415 search results - page 672 / 683
» Lower Bounds for Kernelizations
Sort
View
PRL
2008
85views more  PRL 2008»
13 years 9 months ago
Reliability estimation of a statistical classifier
Pattern classification techniques derived from statistical principles have been widely studied and have proven powerful in addressing practical classification problems. In real-wo...
Pandu Ranga Rao Devarakota, Bruno Mirbach, Bjö...
SIAMSC
2008
168views more  SIAMSC 2008»
13 years 9 months ago
Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi
SIGMETRICS
2008
ACM
13 years 9 months ago
Scheduling despite inexact job-size information
Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in recent years many computer systems have used the heuristic of "favoring sm...
Adam Wierman, Misja Nuyens
TIT
2008
116views more  TIT 2008»
13 years 9 months ago
On the Complexity of Hardness Amplification
We study the task of transforming a hard function f, with which any small circuit disagrees on (1 - )/2 fraction of the input, into a harder function f , with which any small circ...
Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu
TON
2008
109views more  TON 2008»
13 years 9 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...