Sciweavers

140 search results - page 21 / 28
» Computing the Edit-Distance between Unrooted Ordered Trees
Sort
View
ICDM
2002
IEEE
91views Data Mining» more  ICDM 2002»
14 years 1 months ago
Mining Molecular Fragments: Finding Relevant Substructures of Molecules
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instea...
Christian Borgelt, Michael R. Berthold
VLSID
2002
IEEE
127views VLSI» more  VLSID 2002»
14 years 9 months ago
Switching Activity Estimation of Large Circuits using Multiple Bayesian Networks
Switching activity estimation is a crucial step in estimating dynamic power consumption in CMOS circuits. In [1], we proposed a new switching probability model based on Bayesian N...
Sanjukta Bhanja, N. Ranganathan
CVPR
2006
IEEE
14 years 2 months ago
New Method of Probability Density Estimation with Application to Mutual Information Based Image Registration
We present a new, robust and computationally efficient method for estimating the probability density of the intensity values in an image. Our approach makes use of a continuous r...
Ajit Rajwade, Arunava Banerjee, Anand Rangarajan
PVLDB
2011
12 years 11 months ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet
CORR
2007
Springer
133views Education» more  CORR 2007»
13 years 8 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel