Sciweavers

2223 search results - page 122 / 445
» Ontological Framework for Approximation
Sort
View
CRYPTO
2004
Springer
86views Cryptology» more  CRYPTO 2004»
15 years 10 months ago
On Multiple Linear Approximations
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
Alex Biryukov, Christophe De Cannière, Mich...
125
Voted
WECWIS
2005
IEEE
137views ECommerce» more  WECWIS 2005»
15 years 10 months ago
Using Singular Value Decomposition Approximation for Collaborative Filtering
Singular Value Decomposition (SVD), together with the Expectation-Maximization (EM) procedure, can be used to find a low-dimension model that maximizes the loglikelihood of obser...
Sheng Zhang, Weihong Wang, James Ford, Fillia Make...
PAMI
2007
176views more  PAMI 2007»
15 years 4 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
ICIP
2000
IEEE
16 years 6 months ago
Approximately Optimal Assignment for Unequal Loss Protection
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1...
Alexander E. Mohr, Richard E. Ladner, Eve A. Riski...
FOCS
2009
IEEE
15 years 11 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...