Sciweavers

789 search results - page 31 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
CORR
2006
Springer
182views Education» more  CORR 2006»
13 years 7 months ago
Cryptanalysis of the CFVZ cryptosystem
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...
Joan-Josep Climent, E. Gorla, J. Rosenthal
IJON
2010
112views more  IJON 2010»
13 years 4 months ago
Efficient voting prediction for pairwise multilabel classification
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...
Eneldo Loza Mencía, Sang-Hyeun Park, Johann...
TON
2008
99views more  TON 2008»
13 years 7 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
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...
Reuven Cohen, Gabi Nakibly
TSP
2010
13 years 2 months ago
Efficient recursive estimators for a linear, time-varying Gaussian model with general constraints
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...
Stefan Uhlich, Bin Yang
ATAL
2010
Springer
13 years 8 months ago
Incentive analysis of approximately efficient allocation algorithms
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 ...
Yevgeniy Vorobeychik, Yagil Engel