9611 search results - page 53 / 1923 » A Note on Difference Sets |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
WSDM
2012
ACM
2012
ACM
Large-scale analysis of individual and task differences in search result page examination strategies
12 years 3 months ago
Understanding the impact of individual and task differences on search result page examination strategies is important in developing improved search engines. Characterizing these e...
BMCBI
2007
2007
Application of amino acid occurrence for discriminating different folding types of globular proteins
13 years 7 months ago
Background: Predicting the three-dimensional structure of a protein from its amino acid sequence is a long-standing goal in computational/molecular biology. The discrimination of ...
WWW
2010
ACM
14 years 2 months ago
2010
ACM
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
SDM
2003
SIAM
13 years 9 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...