Sciweavers

307 search results - page 14 / 62
» A Comparison of Algorithms for Connected Set Openings and Cl...
Sort
View
IEEECGIV
2008
IEEE
14 years 1 months ago
An Approach to the Feature-Based Comparisons for the Rational Curves
In image processing, the curve comparisons can be achieved by extracting the curve information from the bitmapped images. The revealed curves are represented in the forms of the s...
Chanon Aphirukmatakun, Natasha Dejdumrong
BMCBI
2010
151views more  BMCBI 2010»
13 years 7 months ago
Using diffusion distances for flexible molecular shape comparison
Background: Many molecules are flexible and undergo significant shape deformation as part of their function, and yet most existing molecular shape comparison (MSC) methods treat t...
Yu-Shen Liu, Qi Li, Guo-Qin Zheng, Karthik Ramani,...
COLT
2006
Springer
13 years 11 months ago
Continuous Experts and the Binning Algorithm
Abstract. We consider the design of online master algorithms for combining the predictions from a set of experts where the absolute loss of the master is to be close to the absolut...
Jacob Abernethy, John Langford, Manfred K. Warmuth
ACM
1995
13 years 11 months ago
Rough Sets
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
Zdzislaw Pawlak
SPIRE
2009
Springer
13 years 12 months ago
Faster Algorithms for Sampling and Counting Biological Sequences
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
Christina Boucher