3256 search results - page 484 / 652 » Learning Linear Transformations |
169
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
199
click to vote
JSAT
2006
15 years 6 months ago
2006
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
193
click to vote
SSPR
2010
Springer
15 years 4 months ago
2010
Springer
Many approaches to learning classifiers for structured objects (e.g., shapes) use generative models in a Bayesian framework. However, state-of-the-art classifiers for vectorial d...
168
click to vote
FOCS
2005
IEEE
16 years 20 hour ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
178
click to vote
PKC
2009
Springer
16 years 7 months ago
2009
Springer
We explore the security of blind signatures under aborts where the user or the signer may stop the interactive signature issue protocol prematurely. Several works on blind signatur...