789 search results - page 31 / 158 » Solving Complex Problems Efficiently with Adaptive Automata |
131
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The paper analyzes CFVZ, a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the co...
119
Voted
IJON
2010
15 years 18 days ago
2010
The pairwise approach to multilabel classification reduces the problem to learning and aggregating preference predictions among the possible labels. A key problem is the need to qu...
115
click to vote
TON
2008
15 years 3 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
143
Voted
TSP
2010
14 years 10 months ago
2010
The adaptive estimation of a time-varying parameter vector in a linear Gaussian model is considered where we a priori know that the parameter vector belongs to a known arbitrary s...
133
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
We present a series of results providing evidence that the incentive problem with VCG-based mechanisms is not very severe. Our first result uses average-case analysis to show that ...