Sciweavers

562 search results - page 37 / 113
» Dependency Pairs Revisited
Sort
View
ICDE
2003
IEEE
133views Database» more  ICDE 2003»
16 years 3 months ago
Evaluating Window Joins over Unbounded Streams
We investigate algorithms for evaluating moving window joins over pairs of unbounded streams. We introduce a unit-time-basis cost model to analyze the expected performance of thes...
Jaewoo Kang, Jeffrey F. Naughton, Stratis Viglas
FC
2005
Springer
171views Cryptology» more  FC 2005»
15 years 7 months ago
Identity-Based Partial Message Recovery Signatures (or How to Shorten ID-Based Signatures)
Abstract. We firstly proposed a new notion of short identity-based signature scheme. We argue that the identity-based environment is essential in some scenarios. The notion of sho...
Fangguo Zhang, Willy Susilo, Yi Mu
IJCM
2010
80views more  IJCM 2010»
15 years 9 days ago
On implementing recognizable transductions
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
Stavros Konstantinidis, Nicolae Santean, S. Yu
FLAIRS
2006
15 years 3 months ago
Dependency-based Textual Entailment
This paper studies the role of dependency information for the task of textual entailment. Both the Text and Hypothesis of an entailment pair are mapped into sets of dependencies a...
Vasile Rus
99
Voted
ICS
2010
Tsinghua U.
15 years 11 months ago
Cache Replacement Policies for Multicore Processors
Almost all of the modern computers use multiple cores, and the number of cores is expected to increase as hardware prices go down, and Moore's law fails to hold. Most of the ...
Avinatan Hassidim