Sciweavers

2492 search results - page 77 / 499
» On the General Signature Trees
Sort
View
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
14 years 1 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
JOLLI
2006
101views more  JOLLI 2006»
13 years 7 months ago
A Note on the Expressive Power of Probabilistic Context Free Grammars
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering ...
Gabriel G. Infante López, Maarten de Rijke
COMBINATORICA
2004
127views more  COMBINATORICA 2004»
13 years 7 months ago
On Infinite Cycles I
We extend the basic theory concerning the cycle space of a finite graph to infinite locally finite graphs, using as infinite cycles the homeomorphic images of the unit circle in t...
Reinhard Diestel, Daniela Kühn
DM
1999
122views more  DM 1999»
13 years 7 months ago
Parking functions, valet functions and priority queues
We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...
Julian D. Gilbey, Louis H. Kalikow
WWW
2007
ACM
14 years 8 months ago
Integrating web directories by learning their structures
Documents in the Web are often organized using category trees by information providers (e.g. CNN, BBC) or search engines (e.g. Google, Yahoo!). Such category trees are commonly kn...
Christopher C. Yang, Jianfeng Lin