4137 search results - page 139 / 828 » On the number of matchings of a tree |
173
click to vote
NIPS
2008
15 years 8 months ago
2008
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
193
click to vote
IEAAIE
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we propose to apply an NA-tree in the Chord system to encode spatial region data in the data key part used in the hash function to data search. That is, we combine t...
177
click to vote
WECWIS
2007
IEEE
16 years 23 days ago
2007
IEEE
When there are a large number of web services available and no single service satisfies the given request, one has to compose multiple web services to fulfill the goal, considerin...
153
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
Let k3(n) denote the minimal cardinality of a ternary code of length n and covering radius one. In this paper we show k3(7) ≥ 156 and k3(8) ≥ 402 improving on the best previou...
188
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...