376 search results - page 7 / 76 » Developing Theories of Types and Computability via Realizabi... |
JCB
2007
13 years 7 months ago
2007
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome...
ESOP
2004
Springer
14 years 26 days ago
2004
Springer
The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to e...
CVPR
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper, we propose a novel algorithm for computing an atlas from a collection of images. In the literature, atlases have almost always been computed as some types of means ...
CISS
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
GI
2004
Springer
14 years 26 days ago
2004
Springer
: In this paper we describe one of the authors’ experiences working for an IT service provider in an SME environment. The paper starts with an analysis of the factors typical for...