Sciweavers

2913 search results - page 264 / 583
» How Much to Copy
Sort
View
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
15 years 8 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates
ECOOP
1999
Springer
15 years 8 months ago
Providing Persistent Objects in Distributed Systems
THOR is a persistent object store that provides a powerful programming model. THOR ensures that persistent objects are accessed only by calling their methods and it supports atomic...
Barbara Liskov, Miguel Castro, Liuba Shrira, Atul ...
HUC
1999
Springer
15 years 8 months ago
Augmented Workspace: The World as Your Desktop
We live in a three dimensional world, and much of what we do and how we interact in the physical world has a strong spatial component. Unfortunately, most of our interaction with t...
Kelly L. Dempski
WETICE
1998
IEEE
15 years 8 months ago
The Problem with Multiple Roots in Web Browsers - Certificate Masquerading
Much work is going into securing the public key infrastructure (PKI). Various models for trust exist; Pretty Good Privacy (PGP) and the Progressive-Constraint Trust model are exam...
James M. Hayes
LOPSTR
1998
Springer
15 years 8 months ago
Using Decision Procedures to Accelerate Domain-Specific Deductive Synthesis Systems
This paper describes a class of decision procedures that we have found useful for efficient, domain-specific deductive synthesis, and a method for integrating this type of procedur...
Jeffrey Van Baalen, Steve Roach