Sciweavers

1852 search results - page 355 / 371
» From Bi-ideals to Periodicity
Sort
View
TIME
1994
IEEE
14 years 25 days ago
An Algebraic Formulation of Temporal Knowledge for Reasoning about Recurring Events
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
Robert A. Morris, William D. Shoaff, Lina Khatib
CIKM
1993
Springer
14 years 24 days ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe
STACS
1992
Springer
14 years 23 days ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
SIGOPSE
1990
ACM
14 years 22 days ago
A replicated Unix file system
u s e s t h e p r i m a r y c o p y r e p l i c a t i o nAbstract technique [1, 26, 27]. In this method, client calls are directed to a single primary server, which communicatesThi...
Barbara Liskov, Robert Gruber, Paul Johnson, Liuba...
DEXA
1998
Springer
179views Database» more  DEXA 1998»
14 years 22 days ago
Concurrent Warehouse Maintenance Without Compromising Session Consistency
Abstract. To achieve acceptable query response times in data warehouse environments, the data have to be pre-aggregated according to the need of the applications and stored redunda...
Michael Teschke, Achim Ulbrich