5100 search results - page 282 / 1020 » The Linear Complexity of a Graph |
121
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
130
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic progra...
119
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— The objective of this paper is the linear reconstruction of a vector, up to a unimodular constant, when all phase information is lost, meaning only the magnitudes of fr...
121
click to vote
SIBGRAPI
2006
IEEE
15 years 10 months ago
2006
IEEE
Statistical discrimination methods are suitable not only for classification but also for characterisation of differences between a reference group of patterns and the population u...
119
click to vote
ASIACRYPT
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against a...