Sciweavers

2949 search results - page 79 / 590
» Universal Sparse Modeling
Sort
View
109
Voted
ECCC
2008
122views more  ECCC 2008»
15 years 22 days ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
16 years 29 days ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
68
Voted
ICDS
2009
IEEE
15 years 7 months ago
Anticipating the Digital University
The University of the Digital Society is based on interactions that facilitate learning in a new pragmatic context. Catalysts involved in the learning process replace the traditio...
Mihai Nadin
106
Voted
ATC
2009
Springer
15 years 7 months ago
A Universal Self-Organization Mechanism for Role-Based Organic Computing Systems
Abstract. An Organic Computing system has the ability to autonomously (re-)organize and adapt itself. Such a system exhibits so called self-x properties (e.g. self-healing) and is ...
Florian Nafz, Frank Ortmeier, Hella Seebach, Jan-P...
92
Voted
CIE
2009
Springer
15 years 7 months ago
First-Order Universality for Real Programs
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...
Thomas Anberrée