Sciweavers

1024 search results - page 102 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
15 years 10 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
CRYPTO
2004
Springer
86views Cryptology» more  CRYPTO 2004»
15 years 3 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...
SIGGRAPH
1996
ACM
15 years 2 months ago
Blue Screen Matting
A classical problem of imaging--the matting problem--is separation of a non-rectangular foreground image from a (usually) rectangular background image--for example, in a film fram...
Alvy Ray Smith, James F. Blinn
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
14 years 11 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
BMCBI
2008
97views more  BMCBI 2008»
14 years 10 months ago
Interrogating domain-domain interactions with parsimony based approaches
Background: The identification and characterization of interacting domain pairs is an important step towards understanding protein interactions. In the last few years, several met...
Katia S. Guimarães, Teresa M. Przytycka