Sciweavers

501 search results - page 35 / 101
» Rough Sets and Approximation Schemes
Sort
View
ICPR
2002
IEEE
14 years 11 months ago
A Computationally Efficient Approach to Indoor/Outdoor Scene Classification
Prior research in scene classification has shown that high-level information can be inferred from low-level image features. Classification rates of roughly 90% have been reported ...
Navid Serrano, Andreas E. Savakis, Jiebo Luo
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
13 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
ASIACRYPT
2009
Springer
14 years 4 months ago
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
Vadim Lyubashevsky
ICML
2010
IEEE
13 years 11 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
JMLR
2006
150views more  JMLR 2006»
13 years 9 months ago
Building Support Vector Machines with Reduced Classifier Complexity
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...
S. Sathiya Keerthi, Olivier Chapelle, Dennis DeCos...