Sciweavers

229 search results - page 28 / 46
» Speeding Up Two String-Matching Algorithms
Sort
View
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
14 years 1 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland
AGENTS
2001
Springer
14 years 15 hour ago
Hierarchical multi-agent reinforcement learning
In this paper, we investigate the use of hierarchical reinforcement learning (HRL) to speed up the acquisition of cooperative multi-agent tasks. We introduce a hierarchical multi-a...
Rajbala Makar, Sridhar Mahadevan, Mohammad Ghavamz...
SIGMOD
1998
ACM
124views Database» more  SIGMOD 1998»
13 years 11 months ago
An Alternative Storage Organization for ROLAP Aggregate Views Based on Cubetrees
The Relational On-Line Analytical Processing (ROLAP) is emerging as thedominant approach in data warehousing with decision support applications. In order to enhance query performa...
Yannis Kotidis, Nick Roussopoulos
CVPR
2010
IEEE
14 years 3 months ago
A Steiner Tree approach to efficient object detection
We propose an approach to speeding up object detection, with an emphasis on settings where multiple object classes are being detected. Our method uses a segmentation algorithm to ...
Olga Russakovsky, Quoc Le, Andrew Ng
ICDM
2008
IEEE
102views Data Mining» more  ICDM 2008»
14 years 1 months ago
Mining Order-Preserving Submatrices from Data with Repeated Measurements
Order-preserving submatrices (OPSM’s) have been shown useful in capturing concurrent patterns in data when the relative magnitudes of data items are more important than their ab...
Chun Kit Chui, Ben Kao, Kevin Y. Yip, Sau Dan Lee