Sciweavers

745 search results - page 29 / 149
» The origins of combinatorics on words
Sort
View
CORR
2007
Springer
67views Education» more  CORR 2007»
14 years 10 months ago
Interroger un corpus par le sens
In textual knowledge management, statistical methods prevail. Nonetheless, some difficulties cannot be overcome by these methodologies. I propose a symbolic approach using a comp...
Bernard Jacquemin
CIKM
2010
Springer
14 years 7 months ago
Modeling reformulation using passage analysis
Query reformulation modifies the original query with the aim of better matching the vocabulary of the relevant documents, and consequently improving ranking effectiveness. Previou...
Xiaobing Xue, W. Bruce Croft, David A. Smith
AUTOMATICA
2010
72views more  AUTOMATICA 2010»
14 years 10 months ago
A sufficient condition to test identifiability of nonlinear delayed-differential models with constant delays and multi-inputs
In this paper, an original result in terms of a sufficient condition to test identifiability of nonlinear delayed-differential models with constant delays and multi-inputs is give...
Carine Jauberthie, Louise Travé-Massuy&egra...
ISPEC
2005
Springer
15 years 3 months ago
On the Security of Some Nonrepudiable Threshold Proxy Signature Schemes
A (t, n) threshold proxy signature scheme enables an original signer to delegate the signature authority to a proxy group of n member such that t or more than t proxy signers can ...
Zuowen Tan, Zhuojun Liu, Wang Mingsheng
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 2 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers