Sciweavers

329 search results - page 13 / 66
» New lower bounds for some spherical designs
Sort
View
ICCV
2007
IEEE
14 years 9 months ago
Limits of Learning-Based Superresolution Algorithms
Learning-based superresolution (SR) are popular SR techniques that use application dependent priors to infer the missing details in low resolution images (LRIs). However, their pe...
Zhouchen Lin, Junfeng He, Xiaoou Tang, Chi-Keung T...
CSR
2007
Springer
14 years 1 months ago
New Bounds for MAX-SAT by Clause Learning
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
Alexander S. Kulikov, Konstantin Kutzkov
COCOON
2005
Springer
14 years 27 days ago
New Streaming Algorithms for Counting Triangles in Graphs
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
Hossein Jowhari, Mohammad Ghodsi
ISCC
2005
IEEE
130views Communications» more  ISCC 2005»
14 years 29 days ago
Fair and Efficient Frame-Based Scheduling Algorithm for Multimedia Networks
The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model...
T. Al-Khasib, Hussein M. Alnuweiri, Hossam Fattah,...
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir