Sciweavers

3134 search results - page 112 / 627
» Computing full disjunctions
Sort
View
JACM
2012
13 years 5 months ago
Continuous sampling from distributed streams
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
167
Voted
HPDC
2012
IEEE
13 years 4 months ago
Work stealing and persistence-based load balancers for iterative overdecomposed applications
Applications often involve iterative execution of identical or slowly evolving calculations. Such applications require incremental rebalancing to improve load balance across itera...
Jonathan Lifflander, Sriram Krishnamoorthy, Laxmik...
128
Voted
AAAI
2012
13 years 4 months ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
PPSN
1990
Springer
15 years 6 months ago
Feature Construction for Back-Propagation
T h e ease of learning concepts f r o m examples in empirical machine learning depends on the attributes used for describing the training d a t a . We show t h a t decision-tree b...
Selwyn Piramuthu
IPPS
2009
IEEE
15 years 9 months ago
Implementing protein seed-based comparison algorithm on the SGI RASC-100 platform
This paper describes a parallel FPGA implementation of a genomic sequence comparison algorithm for finding similarities between a large set of protein sequences and full genomes....
Van Hoa Nguyen, Alexandre Cornu, Dominique Lavenie...