Sciweavers

2436 search results - page 98 / 488
» Comonadic Notions of Computation
Sort
View
105
Voted
MFCS
1990
Springer
15 years 8 months ago
One-Way Functions in Complexity Theory
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
Alan L. Selman
FOCS
2000
IEEE
15 years 7 months ago
Topological Persistence and Simplification
We formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens ...
Herbert Edelsbrunner, David Letscher, Afra Zomorod...
CVPR
2012
IEEE
13 years 6 months ago
Learning rotation-aware features: From invariant priors to equivariant descriptors
Identifying suitable image features is a central challenge in computer vision, ranging from representations for lowlevel to high-level vision. Due to the difficulty of this task,...
Uwe Schmidt, Stefan Roth
HPCS
2002
IEEE
15 years 8 months ago
MetaGrid: A Scalable Framework for Wide-Area Service Deployment and Management
This paper presents a novel architecture called the MetaGrid based on Grid computing concepts for resource provisioning for wide-area network-enabled applications. Resource provis...
Muthucumaru Maheswaran, Balasubramaneyam Maniymara...
PODS
2008
ACM
155views Database» more  PODS 2008»
16 years 4 months ago
The recovery of a schema mapping: bringing exchanged data back
A schema mapping is a specification that describes how data from a source schema is to be mapped to a target schema. Once the data has been transferred from the source to the targ...
Marcelo Arenas, Jorge Pérez, Cristian River...