Sciweavers

2356 search results - page 356 / 472
» Characterizations of postman sets
Sort
View
NIPS
2008
15 years 6 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
170
Voted
LWA
2007
15 years 6 months ago
Know the Right People? Recommender Systems for Web 2.0
Web 2.0 applications like Flickr, YouTube, or Del.icio.us are increasingly popular online communities for creating, editing and sharing content. However, the rapid increase in siz...
Stefan Siersdorfer, Sergej Sizov, Paul Clough
NIPS
2007
15 years 6 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 6 months ago
Discriminative Keyword Selection Using Support Vector Machines
Many tasks in speech processing involve classification of long term characteristics of a speech segment such as language, speaker, dialect, or topic. A natural technique for dete...
William M. Campbell, Fred S. Richardson
WICON
2008
15 years 6 months ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal