3020 search results - page 300 / 604 » Optimal partition trees |
197
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
181
click to vote
CPM
1999
Springer
15 years 11 months 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...
195
click to vote
FCCM
2009
IEEE
15 years 10 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...
200
click to vote
HIS
2008
15 years 8 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...
173
click to vote
CCCG
2001
15 years 8 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...