Sciweavers

17505 search results - page 3389 / 3501
» Use Cases as Workflows
Sort
View
VLDB
1994
ACM
126views Database» more  VLDB 1994»
15 years 8 months ago
Building a Laboratory Information System Around a C++-Based Object-Oriented DBMS
MapBase is a laboratory information system that has been supporting a high-throughput genome-mapping operation for the last three years. We chose to build MapBase around a C++-bas...
Nathan Goodman, Steve Rozen, Lincoln Stein
WG
1994
Springer
15 years 8 months ago
Fugitive-Search Games on Graphs and Related Parameters
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M...
STACS
1992
Springer
15 years 8 months 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...
STACS
1992
Springer
15 years 8 months ago
Secure Commitment Against A Powerful Adversary
abstract Rafail Ostrovskyy Ramarathnam Venkatesanz Moti Yungx Secure commitment is a primitive enabling information hiding, which is one of the most basic tools in cryptography. S...
Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yun...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 8 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
« Prev « First page 3389 / 3501 Last » Next »