CS Store Search
Displaying 1-5 out of 5 total
The Context-Aware Browser
IEEE Intelligent Systems
By Paolo Coppola, Vincenzo Della Mea, Luca Di Gaspero, Davide Menegon, Danny Mischis, Stefano Mizzaro, Ivan Scagnetto, Luca Vassena
Issue Date:January 2010
<p>The Context-Aware Browser for mobile devices senses the surrounding environment, infers the user's current context, and proactively searches for and activates relevant Web documents and applications.</p>
Light Logics and Optimal Reduction: Completeness and Complexity
Logic in Computer Science, Symposium on
By Patrick Baillot, Paolo Coppola, Ugo Dal Lago
Issue Date:July 2007
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL resp.) proof-nets admits a guaranteed polynomial (elementary, resp.) boun...
Optimizing optimal reduction: A type inference algorithm for elementary affine logic
Found in: ACM Transactions on Computational Logic (TOCL)
By Paolo Coppola, Simone Martini
Issue Date:April 2006
We propose a type inference algorithm for lambda terms in elementary affine logic (EAL). The algorithm decorates the syntax tree of a simple typed lambda term and collects a set of linear constraints. The result is a parametric elementary type that can be ...
Animated products as a navigation aid for e-commerce
CHI '00 extended abstracts on Human factors in computer systems (CHI '00)
By Luca Chittaro, Paolo Coppola
Issue Date:April 2000
Virtual Reality (VR) interfaces to e-commerce sites promise to make the e-shopping experience more natural, attractive, and fun for buyers. In this paper, we first briefly introduce the navigation problem, then we propose a novel navigation aid to help cus...
(Optimal) duplication is not elementary recursive
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL '00)
By Andrea Asperti, Paolo Coppola, Simone Martini
Issue Date:January 2000
Inclusion-based program analyses are implemented by adding new edges to directed graphs. In most analyses, there are many different ways to add a transitive edge between two nodes, namely through each different path connecting the nodes. This path redundan...
Original Search Engine
Need a Web Account?
Become a Member
This site and all contents (unless otherwise noted) are Copyright ©2008, IEEE, Inc. All rights reserved.