Sciweavers

620 search results - page 98 / 124
» Learning with Temporary Memory
Sort
View
GRID
2010
Springer
13 years 4 months ago
Parallel SAT Solving on Peer-to-Peer Desktop Grids
Abstract Satciety is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domainspecific problems inherent to one of the most challenging environments f...
Sven Schulz, Wolfgang Blochinger
ATAL
2009
Springer
14 years 2 months ago
Bounded rationality via recursion
Current trends in model construction in the field of agentbased computational economics base behavior of agents on either game theoretic procedures (e.g. belief learning, fictit...
Maciej Latek, Robert L. Axtell, Bogumil Kaminski
ICCV
2009
IEEE
1318views Computer Vision» more  ICCV 2009»
15 years 11 days ago
Non-Local Sparse Models for Image Restoration
We propose in this paper to unify two different ap- proaches to image restoration: On the one hand, learning a basis set (dictionary) adapted to sparse signal descriptions has p...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
ICML
2005
IEEE
14 years 8 months ago
Large scale genomic sequence SVM classifiers
In genomic sequence analysis tasks like splice site recognition or promoter identification, large amounts of training sequences are available, and indeed needed to achieve suffici...
Bernhard Schölkopf, Gunnar Rätsch, S&oum...
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
14 years 7 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos