994 search results - page 91 / 199 » Custom Computing Machines for the Set Covering Problem |
116
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
93
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
We develop a penalized kernel smoothing method for the problem of selecting nonzero elements of the conditional precision matrix, known as conditional covariance selection. This p...
118
Voted
ISPASS
2006
IEEE
15 years 6 months ago
2006
IEEE
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...
111
Voted
SOSP
2007
ACM
15 years 9 months ago
2007
ACM
This paper describes an efficient and robust approach to provide a safe execution environment for an entire operating system, such as Linux, and all its applications. The approach...
90
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper introduces a novel machine learning model called multiple instance ranking (MIRank) that enables ranking to be performed in a multiple instance learning setting. The mo...