Sciweavers

11211 search results - page 2052 / 2243
» Rank-Sensitive Data Structures
Sort
View
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 4 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
107
Voted
NIPS
2007
15 years 4 months ago
Hippocampal Contributions to Control: The Third Way
Recent experimental studies have focused on the specialization of different neural structures for different types of instrumental behavior. Recent theoretical work has provided no...
Máté Lengyel, Peter Dayan
NIPS
2007
15 years 4 months ago
Comparing Bayesian models for multisensory cue combination without mandatory integration
Bayesian models of multisensory perception traditionally address the problem of estimating an underlying variable that is assumed to be the cause of the two sensory signals. The b...
Ulrik Beierholm, Konrad P. Körding, Ladan Sha...
NIPS
2007
15 years 4 months ago
Sparse Feature Learning for Deep Belief Networks
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...
Marc'Aurelio Ranzato, Y-Lan Boureau, Yann LeCun
RIAO
2007
15 years 4 months ago
Comprehensible and Accurate Cluster Labels in Text Clustering
The purpose of text clustering in information retrieval is to discover groups of semantically related documents. Accurate and comprehensible cluster descriptions (labels) let the ...
Jerzy Stefanowski, Dawid Weiss
« Prev « First page 2052 / 2243 Last » Next »