Sciweavers

450 search results - page 31 / 90
» Estimating Search Tree Size
Sort
View
IEICET
2010
96views more  IEICET 2010»
13 years 7 months ago
An Unsupervised Optimization of Structuring Elements for Noise Removal Using GA
—To recover texture images from impulse noise by the opening operation which is one of morphological operations, an suitable structuring element (SE) has to be estimated. Hithert...
Hiroyuki Okuno, Yoshiko Hanada, Mitsuji Muneyasu, ...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 11 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 7 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
INTERSPEECH
2010
13 years 3 months ago
Decision tree state clustering with word and syllable features
In large vocabulary continuous speech recognition, decision trees are widely used to cluster triphone states. In addition to commonly used phonetically based questions, others hav...
Hank Liao, Christopher Alberti, Michiel Bacchiani,...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 9 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb