Sciweavers

1922 search results - page 373 / 385
» ie 2007
Sort
View
AI
2007
Springer
13 years 11 months ago
On the merging of Dung's argumentation systems
In this paper, the problem of deriving sensible information from a collection of argumentation systems coming from different agents is addressed. The underlying argumentation the...
Sylvie Coste-Marquis, Caroline Devred, Séba...
AMAI
2007
Springer
13 years 11 months ago
Relational concept discovery in structured datasets
Relational datasets, i.e., datasets in which individuals are described both by their own features and by their relations to other individuals, arise from various sources such as d...
Marianne Huchard, Mohamed Rouane Hacene, Cyril Rou...
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 11 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
CC
2007
Springer
123views System Software» more  CC 2007»
13 years 11 months ago
An Improved Analysis of Linear Mergers
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
Zeev Dvir, Amir Shpilka
CC
2007
Springer
108views System Software» more  CC 2007»
13 years 11 months ago
Communication vs. Computation
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Ni...