Sciweavers

1679 search results - page 164 / 336
» Pointcuts as Functional Queries
Sort
View
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
15 years 10 months ago
Composition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
Krzysztof Pietrzak
LPAR
1999
Springer
15 years 9 months ago
A Partial Evaluation Framework for Curry Programs
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
Elvira Albert, María Alpuente, Michael Hanu...
CIKM
2007
Springer
15 years 11 months ago
Effective top-k computation in retrieving structured documents with term-proximity support
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
Mingjie Zhu, Shuming Shi, Mingjing Li, Ji-Rong Wen
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 9 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
CC
2007
Springer
108views System Software» more  CC 2007»
15 years 5 months ago
Communication vs. Computation
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Ni...