Sciweavers

170 search results - page 15 / 34
» Cross-Composition: A New Technique for Kernelization Lower B...
Sort
View
JMLR
2008
129views more  JMLR 2008»
13 years 7 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 14 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
MICRO
1999
IEEE
110views Hardware» more  MICRO 1999»
13 years 12 months ago
Balance Scheduling: Weighting Branch Tradeoffs in Superblocks
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
Alexandre E. Eichenberger, Waleed Meleis
COLT
2008
Springer
13 years 9 months ago
Linear Algorithms for Online Multitask Classification
We design and analyze interacting online algorithms for multitask classification that perform better than independent learners whenever the tasks are related in a certain sense. W...
Giovanni Cavallanti, Nicolò Cesa-Bianchi, C...
ICCAD
2003
IEEE
154views Hardware» more  ICCAD 2003»
14 years 4 months ago
Fast, Accurate Static Analysis for Fixed-Point Finite-Precision Effects in DSP Designs
Translating digital signal processing (DSP) software into its finite-precision hardware implementation is often a timeconsuming task. We describe a new static analysis technique ...
Claire Fang Fang, Rob A. Rutenbar, Tsuhan Chen