807 search results - page 100 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
150
Voted
COMPUTING
2008
15 years 3 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
124
Voted
UAI
1996
15 years 5 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
267
Voted
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
136
Voted
ICMLA
2009
15 years 1 months ago
2009
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
167
Voted
ALENEX
2001
15 years 5 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...