Sciweavers

377 search results - page 42 / 76
» Linear Tabling Strategies and Optimizations
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Classifier subset selection and fusion for speaker verification
State-of-the-art speaker verification systems consists of a number of complementary subsystems whose outputs are fused, to arrive at more accurate and reliable verification deci...
Filip Sedlak, Tomi Kinnunen, Ville Hautamäki,...
ICML
2010
IEEE
13 years 8 months ago
Toward Off-Policy Learning Control with Function Approximation
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
Hamid Reza Maei, Csaba Szepesvári, Shalabh ...
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 9 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
COLT
2005
Springer
14 years 1 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
DEXA
1995
Springer
126views Database» more  DEXA 1995»
13 years 11 months ago
A Heuristic Approach for Optimization of Path Expressions
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
Cetin Ozkan, Asuman Dogac, Cem Evrendilek