Sciweavers

428 search results - page 75 / 86
» Completeness of a Fact Extractor
Sort
View
73
Voted
MUC
1992
15 years 1 months ago
GE-CMU: description of the TIPSTER/SHOGUN system as used for MUC-4
The GE-CMU team is developing the TIPSTER/SHOGUN system under the governmentsponsored TIPSTER program, which aims to advance coverage, accuracy, and portability in tex t interpret...
Paul S. Jacobs, George B. Krupka, Lisa F. Rau, Tod...
POPL
1992
ACM
15 years 1 months ago
A Compilation Method for ML-Style Polymorphic Record Calculi
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...
Atsushi Ohori
CTCS
1989
Springer
15 years 1 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
STACS
1992
Springer
15 years 1 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...
102
Voted
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 1 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen