Sciweavers

159 search results - page 26 / 32
» Weak Equivalences in Psi-Calculi
Sort
View
AGP
1999
IEEE
15 years 5 months ago
Widening Sharing
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
98
Voted
ESOP
2000
Springer
15 years 4 months ago
A Calculus for Link-Time Compilation
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
Elena Machkasova, Franklyn A. Turbak
ICVGIP
2004
15 years 2 months ago
Cursive Word Recognition Using a Novel Feature Extraction Method and a Neural Network
In this paper, we present a holistic system for the recognition of cursive handwriting that utilizes a novel feature extraction method and a neural network. The Hough transform is...
José Ruiz-Pinales, René Jaime-Rivas
109
Voted
OPODIS
2004
15 years 2 months ago
A Constraint-Based Formalism for Consistency in Replicated Systems
Abstract. We present a formalism for modeling replication in a distributed system with concurrent users sharing information. It is based on actions, which represent operations requ...
Marc Shapiro, Karthikeyan Bhargavan, Nishith Krish...
89
Voted
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 2 months ago
Frugality in path auctions
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
Edith Elkind, Amit Sahai, Kenneth Steiglitz