Sciweavers

417 search results - page 27 / 84
» Some Theory for Generalized Boosting Algorithms
Sort
View
WWW
2011
ACM
14 years 11 months ago
Learning to re-rank: query-dependent image re-ranking using click data
Our objective is to improve the performance of keyword based image search engines by re-ranking their baseline results. To this end, we address three limitations of existing searc...
Vidit Jain, Manik Varma
ESANN
2004
15 years 5 months ago
Forbidden Magnification? I
This paper presents some interesting results obtained by the algorithm by Bauer, Der and Hermann (BDH) [1] for magnification control in Self-Organizing Maps. Magnification control ...
Abha Jain, Erzsébet Merényi
MFCS
2005
Springer
15 years 10 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
CRYPTO
2000
Springer
124views Cryptology» more  CRYPTO 2000»
15 years 8 months ago
Fast Correlation Attacks through Reconstruction of Linear Polynomials
The task of a fast correlation attack is to efficiently restore the initial content of a linear feedback shift register in a stream cipher using a detected correlation with the out...
Thomas Johansson, Fredrik Jönsson
AUTOMATICA
2008
78views more  AUTOMATICA 2008»
15 years 4 months ago
Exact determinations of the maximal output admissible set for a class of nonlinear systems
This paper is concerned with obtaining necessary and sufficient conditions for fulfilling specified state and control pointwise-in-time constraints against a certain class of nonli...
Kenji Hirata, Yoshito Ohta