Sciweavers

658 search results - page 99 / 132
» Arguing from Experience to Classifying Noisy Data
Sort
View
SOSP
2009
ACM
14 years 5 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
JMLR
2006
99views more  JMLR 2006»
13 years 8 months ago
Worst-Case Analysis of Selective Sampling for Linear Classification
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
AOSD
2003
ACM
14 years 2 months ago
Persistence as an aspect
Persistence - the storage and retrieval of application data from secondary storage media - is often used as a classical example of a crosscutting concern. It is widely assumed tha...
Awais Rashid, Ruzanna Chitchyan
IADIS
2003
13 years 10 months ago
The Dynamics of Trade Patterns in the Internet Era
The effects of the privatization and commercialization of Internet on world trade are often debated but few rigorous conclusions emerge. Such conclusions have not been based on in...
Vijay K. Vemuri, Shahid Siddiqi
WCE
2007
13 years 10 months ago
A Fast Multivariate Nearest Neighbour Imputation Algorithm
— Imputation of missing data is important in many areas, such as reducing non-response bias in surveys and maintaining medical documentation. Nearest neighbour (NN) imputation al...
Norman Solomon, Giles Oatley, Kenneth McGarry