Sciweavers

278 search results - page 37 / 56
» Algorithmic randomness and monotone complexity on product sp...
Sort
View
ECOOP
2005
Springer
14 years 2 months ago
Derivation and Evaluation of Concurrent Collectors
There are many algorithms for concurrent garbage collection, but they are complex to describe, verify, and implement. This has resulted in a poor understanding of the relationships...
Martin T. Vechev, David F. Bacon, Perry Cheng, Dav...
SIGIR
2004
ACM
14 years 1 months ago
GaP: a factor model for discrete data
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
John F. Canny
IUI
1999
ACM
14 years 23 days ago
Programming by Demonstration: An Inductive Learning Formulation
Although Programming by Demonstration (PBD) has the potential to improve the productivity of unsophisticated users, previous PBD systems have used brittle, heuristic, domain-speci...
Tessa A. Lau, Daniel S. Weld
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 10 months ago
On distributing symmetric streaming computations
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...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
ICML
2004
IEEE
14 years 9 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...