Sciweavers

139 search results - page 5 / 28
» Approximations of upper and lower probabilities by measurabl...
Sort
View
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 6 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
13 years 10 months ago
On the myopic policy for a class of restless bandit problems with applications in dynamic multichannel access
We consider a class of restless multi-armed bandit problems that arises in multi-channel opportunistic communications, where channels are modeled as independent and stochastically...
Keqin Liu, Qing Zhao
FUZZIEEE
2007
IEEE
14 years 12 days ago
Distance Measure Assisted Rough Set Feature Selection
Abstract— Feature Selection (FS) is a technique for dimensionality reduction. Its aims are to select a subset of the original features of a dataset which are rich in the most use...
Neil MacParthalain, Qiang Shen, Richard Jensen
COLT
1993
Springer
13 years 10 months ago
Lower Bounds on the Vapnik-Chervonenkis Dimension of Multi-Layer Threshold Networks
We consider the problem of learning in multilayer feed-forward networks of linear threshold units. We show that the Vapnik-Chervonenkis dimension of the class of functions that ca...
Peter L. Bartlett
CRYPTO
2009
Springer
111views Cryptology» more  CRYPTO 2009»
13 years 10 months ago
The Round Complexity of Verifiable Secret Sharing Revisited
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...
Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pand...