Sciweavers

7106 search results - page 256 / 1422
» Restricted Complexity, General Complexity
Sort
View
FOCS
2006
IEEE
15 years 10 months ago
Input-Indistinguishable Computation
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...
Silvio Micali, Rafael Pass, Alon Rosen
JGAA
2002
74views more  JGAA 2002»
15 years 4 months ago
Realization of Posets
We prove a very general representation theorem for posets and, as a corollary, deduce that any abstract simplicial complex has a geometric realization in the Euclidean space of di...
Patrice Ossona de Mendez
ICDT
2009
ACM
143views Database» more  ICDT 2009»
16 years 5 months ago
Automatic construction of simple artifact-based business processes
Almost all medium- and large-scale businesses rely on electronic workflow systems to manage their business processes. A key challenge is to enable the easy re-use and modification...
Christian Fritz, Richard Hull, Jianwen Su
COMPGEOM
2009
ACM
15 years 11 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
ISRR
2005
Springer
140views Robotics» more  ISRR 2005»
15 years 10 months ago
Tradeoffs Between Directed and Autonomous Driving on the Mars Exploration Rovers
NASA’s Mars Exploration Rovers (MER) have collected a great diversity of geological science results, thanks in large part to their surface mobility capabilities. The six wheel r...
Jeffrey J. Biesiadecki, Chris Leger, Mark W. Maimo...