Sciweavers

994 search results - page 163 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
CCGRID
2007
IEEE
14 years 1 months ago
Exploiting Heterogeneity for Collective Data Downloading in Volunteer-based Networks
Abstract— Scientific computing is being increasingly deployed over volunteer-based distributed computing environments consisting of idle resources on donated user machines. A fu...
Jinoh Kim, Abhishek Chandra, Jon B. Weissman
GI
2003
Springer
14 years 18 days ago
An Integrated Approach to Survivability Analysis of Large Complex Critical Infrastructures
: The integrated approach for analysis of Large Complex Critical Infrastructures (LCCIs) to afford survivability aimed at preparing a Roadmap for Research and Development for criti...
Sandro Bologna, Thomas Beer
BMCBI
2008
218views more  BMCBI 2008»
13 years 7 months ago
LOSITAN: A workbench to detect molecular adaptation based on a Fst-outlier method
Background: Testing for selection is becoming one of the most important steps in the analysis of multilocus population genetics data sets. Existing applications are difficult to u...
Tiago Antao, Ana Lopes, Ricardo J. Lopes, Albano B...
FOCS
2006
IEEE
14 years 1 months ago
Hardness of Learning Halfspaces with Noise
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
Venkatesan Guruswami, Prasad Raghavendra
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud