Sciweavers

1918 search results - page 101 / 384
» Discovering Cortical Algorithms
Sort
View
DCC
2006
IEEE
15 years 9 months ago
Making the Correct Mistakes
We propose a new sequential, adaptive, quadratic-time algorithm for variable-rate lossy compression of memoryless sources at a fixed distortion. The algorithm uses approximate pat...
Dharmendra S. Modha, Narayana P. Santhanam
IPCO
2001
166views Optimization» more  IPCO 2001»
14 years 11 months ago
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
Fabián A. Chudak, Tim Roughgarden, David P....
MLDM
2005
Springer
15 years 3 months ago
CorePhrase: Keyphrase Extraction for Document Clustering
Abstract. The ability to discover the topic of a large set of text documents using relevant keyphrases is usually regarded as a very tedious task if done by hand. Automatic keyphra...
Khaled M. Hammouda, Diego N. Matute, Mohamed S. Ka...
NIPS
2003
14 years 11 months ago
Perception of the Structure of the Physical World Using Unknown Multimodal Sensors and Effectors
Is there a way for an algorithm linked to an unknown body to infer by itself information about this body and the world it is in? Taking the case of space for example, is there a w...
David Philipona, J. K. O'Regan, Jean-Pierre Nadal,...
ICIP
2007
IEEE
15 years 11 months ago
Common Spatial Pattern Discovery by Efficient Candidate Pruning
Automatically discovering common visual patterns in images is very challenging due to the uncertainties in the visual appearances of such spatial patterns and the enormous computa...
Junsong Yuan, Zhu Li, Yun Fu, Ying Wu, Thomas S. H...