Sciweavers

140 search results - page 11 / 28
» P3
Sort
View
DAC
2011
ACM
12 years 8 months ago
Modeling adaptive streaming applications with parameterized polyhedral process networks
The Kahn Process Network (KPN) model is a widely used modelof-computation to specify and map streaming applications onto multiprocessor systems-on-chips. In general, KPNs are difï...
Jiali Teddy Zhai, Hristo Nikolov, Todor Stefanov
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
14 years 19 days ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale
CSL
2009
Springer
14 years 3 months ago
Expanding the Realm of Systematic Proof Theory
Abstract. This paper is part of a general project of developing a systematic and algebraic proof theory for nonclassical logics. Generalizing our previous work on intuitionistic-su...
Agata Ciabattoni, Lutz Straßburger, Kazushig...
ASIACRYPT
2001
Springer
14 years 1 months ago
The Modular Inversion Hidden Number Problem
We study a class of problems called Modular Inverse Hidden Number Problems (MIHNPs). The basic problem in this class is the following: Given many pairs xi, msbk (α + xi)−1 mod p...
Dan Boneh, Shai Halevi, Nick Howgrave-Graham
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
14 years 1 months ago
On the Complexity of Approximating the VC Dimension
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
Elchanan Mossel, Christopher Umans