8695 search results - page 370 / 1739 » Making the Complex Simple |
313
Voted
ISSAC
2011
Springer
14 years 9 months ago
2011
Springer
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
308
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
One important way in which sampling for approximate query processing in a database environment differs from traditional applications of sampling is that in a database, it is feasi...
209
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration vers...
174
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
159
click to vote
EDBT
2002
ACM
16 years 7 months ago
2002
ACM
The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others, preferences are used for information filtering and ex...