Sciweavers

87 search results - page 8 / 18
» Roughness bounds in rough set operations
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
14 years 7 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
COLT
2004
Springer
15 years 2 months ago
An Inequality for Nearly Log-Concave Distributions with Applications to Learning
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...
Constantine Caramanis, Shie Mannor
RTCSA
1999
IEEE
15 years 1 months ago
Bandwidth Reservation for Real Time Traffic in Wireless Mobile Environment
This study proposes a new bandwidth reservation strategy (Two Level Guarantee) in wireless environment based on the user mobility specification which is assumed to be given at cal...
Byung-Kyu Choi, Riccardo Bettati
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
15 years 9 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio