Sciweavers

1014 search results - page 177 / 203
» Answer models for question answering passage retrieval
Sort
View
FOCS
2004
IEEE
15 years 1 months ago
Universally Composable Protocols with Relaxed Set-Up Assumptions
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...
Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafa...
LOGCOM
2010
158views more  LOGCOM 2010»
14 years 8 months ago
Applying Universal Algebra to Lambda Calculus
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
Giulio Manzonetto, Antonino Salibra
75
Voted
ICAIL
1997
ACM
15 years 1 months ago
Automated Drafting of Self-Explaining Documents
The capacity for self-explanation can makecomputer-drafted documents more credible, assist in the retrieval and adaptation of archival documents, and permit comparison of document...
Karl Branting, James C. Lester, Charles B. Callawa...
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
15 years 11 months ago
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
Reza Sherkat, Davood Rafiei
VLDB
2008
ACM
140views Database» more  VLDB 2008»
15 years 10 months ago
Efficient temporal counting with bounded error
This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its s...
Yufei Tao, Xiaokui Xiao