Sciweavers

1632 search results - page 193 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
NIPS
2007
15 years 5 months ago
Active Preference Learning with Discrete Choice Data
We propose an active learning algorithm that learns a continuous valuation model from discrete preferences. The algorithm automatically decides what items are best presented to an...
Eric Brochu, Nando de Freitas, Abhijeet Ghosh
AAAI
2010
15 years 5 months ago
Multi-Agent Plan Recognition: Formalization and Algorithms
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle
INFOCOM
2009
IEEE
15 years 11 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
VTC
2006
IEEE
129views Communications» more  VTC 2006»
15 years 10 months ago
A Framework for Automatic Clustering of Parametric MIMO Channel Data Including Path Powers
— We present a solution to the problem of identifying clusters from MIMO measurement data in a data window, with a minimum of user interaction. Conventionally, visual inspection ...
Nicolai Czink, Pierluigi Cera, Jari Salo, Ernst Bo...
ECAI
2000
Springer
15 years 8 months ago
Naive Bayes and Exemplar-based Approaches to Word Sense Disambiguation Revisited
Abstract. This paper describes an experimental comparison between two standard supervised learning methods, namely Naive Bayes and Exemplar–basedclassification, on the Word Sens...
Gerard Escudero, Lluís Màrquez, Germ...