Sciweavers

886 search results - page 59 / 178
» On the Autoreducibility of Random Sequences
Sort
View
COLT
2007
Springer
14 years 2 months ago
Observational Learning in Random Networks
In the standard model of observational learning, n agents sequentially decide between two alternatives a or b, one of which is objectively superior. Their choice is based on a stoc...
Julian Lorenz, Martin Marciniszyn, Angelika Steger
MCS
2007
Springer
14 years 2 months ago
Random Feature Subset Selection for Ensemble Based Classification of Data with Missing Features
Abstract. We report on our recent progress in developing an ensemble of classifiers based algorithm for addressing the missing feature problem. Inspired in part by the random subsp...
Joseph DePasquale, Robi Polikar
FOCS
2003
IEEE
14 years 1 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
EMNLP
2004
13 years 9 months ago
Applying Conditional Random Fields to Japanese Morphological Analysis
This paper presents Japanese morphological analysis based on conditional random fields (CRFs). Previous work in CRFs assumed that observation sequence (word) boundaries were fixed...
Taku Kudo, Kaoru Yamamoto, Yuji Matsumoto
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 8 months ago
On Certain Large Random Hermitian Jacobi Matrices with Applications to Wireless Communications
In this paper we study the spectrum of certain large random Hermitian Jacobi matrices. These matrices are known to describe certain communication setups. In particular we are inte...
Nathan Levy, Oren Somekh, Shlomo Shamai, Ofer Zeit...