4137 search results - page 615 / 828 » On the number of matchings of a tree |
153
Voted
CIE
2005
Springer
16 years 4 days ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
161
click to vote
CONCUR
2005
Springer
16 years 4 days ago
2005
Springer
Many decidability results are known for non-recursive cryptographic protocols, where the protocol steps can be expressed by simple rewriting rules. Recently, a tree transducer-base...
162
click to vote
CP
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
133
click to vote
SPIRE
2005
Springer
16 years 2 days ago
2005
Springer
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
183
click to vote
SIGIR
2004
ACM
16 years 1 days ago
2004
ACM
In this paper we study the problem of finding most topical named entities among all entities in a document, which we refer to as focused named entity recognition. We show that th...