Sciweavers

1982 search results - page 85 / 397
» Parametricity and dependent types
Sort
View
TKDE
2010
149views more  TKDE 2010»
14 years 11 months ago
A Configurable Rete-OO Engine for Reasoning with Different Types of Imperfect Information
The RETE algorithm is a very efficient option for the development of a rule-based system, but it supports only boolean, first order logic. Many real-world contexts, instead, requir...
Davide Sottara, Paola Mello, Mark Proctor
SIGIR
2009
ACM
15 years 11 months ago
Query dependent pseudo-relevance feedback based on wikipedia
Pseudo-relevance feedback (PRF) via query-expansion has been proven to be effective in many information retrieval (IR) tasks. In most existing work, the top-ranked documents from...
Yang Xu, Gareth J. F. Jones, Bin Wang
DCC
2008
IEEE
16 years 4 months ago
A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....
Eado Meron, Ofer Shayevitz, Meir Feder, Ram Zamir
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
15 years 9 months ago
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda...
CN
2002
112views more  CN 2002»
15 years 4 months ago
State-dependent M/G/1 type queueing analysis for congestion control in data networks
Abstract--We study in this paper a TCP-like linear-increase multiplicative-decrease flow control mechanism. We consider congestion signals that arrive in batches according to a Poi...
Eitan Altman, Konstantin Avrachenkov, Chadi Baraka...