Sciweavers

3894 search results - page 259 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
SIAMMAX
2011
141views more  SIAMMAX 2011»
14 years 10 months ago
Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
Mariya Ishteva, Pierre-Antoine Absil, Sabine Van H...
ICML
2004
IEEE
16 years 8 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
CISS
2008
IEEE
16 years 1 months ago
Distributed processing in frames for sparse approximation
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
Christopher J. Rozell
AAAI
1997
15 years 8 months ago
Combining Approximate Front End Signal Processing with Selective Reprocessing in Auditory Perception
When dealing with signals from complex environments, where multiple time-dependent signal signatures can interfere with each other in stochastically unpredictable ways, traditiona...
Frank Klassner, Victor R. Lesser, Hamid Nawab
ATAL
2007
Springer
16 years 1 months ago
Reducing the complexity of multiagent reinforcement learning
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
Andriy Burkov, Brahim Chaib-draa