455 search results - page 65 / 91 » On Trees and Noncrossing Partitions |
CPM
1999
Springer
14 years 5 days ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
SWAT
1992
Springer
13 years 12 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
FCCM
2009
IEEE
13 years 11 months ago
2009
IEEE
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. Due to the available on-chip memory and the number of I/O pins of Field Programmab...
HIS
2008
13 years 9 months ago
2008
The class imbalance problem (when one of the classes has much less samples than the others) is of great importance in machine learning, because it corresponds to many critical app...
CCCG
2001
13 years 9 months ago
2001
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...