Sciweavers

40 search results - page 6 / 8
» The Jump Classes of Minimal Covers
Sort
View
MFCS
2009
Springer
14 years 2 months ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
EUROCAST
2007
Springer
132views Hardware» more  EUROCAST 2007»
13 years 11 months ago
Using Omnidirectional BTS and Different Evolutionary Approaches to Solve the RND Problem
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
ISSTA
2006
ACM
14 years 1 months ago
Tool support for randomized unit testing
There are several problem areas that must be addressed when applying randomization to unit testing. As yet no general, fully automated solution that works for all units has been p...
James H. Andrews, Susmita Haldar, Yong Lei, Felix ...
FAST
2010
13 years 9 months ago
Tracking Back References in a Write-Anywhere File System
Many file systems reorganize data on disk, for example to defragment storage, shrink volumes, or migrate data between different classes of storage. Advanced file system features s...
Peter Macko, Margo I. Seltzer, Keith A. Smith
NIPS
2008
13 years 9 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari