1213 search results - page 28 / 243 » Finding patterns in the fieldwork |
114
click to vote
MCS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...
175
click to vote
PREMI
2011
Springer
14 years 3 months ago
2011
Springer
This paper presents a potential seed selection algorithm for web crawlers using a gain - share scoring approach. Initially we consider a set of arbitrarily chosen tourism queries. ...
94
Voted
ISSTA
2010
ACM
15 years 2 months ago
2010
ACM
In May 2009, Google conducted a company wide FindBugs “fixit”. Hundreds of engineers reviewed thousands of FindBugs warnings, and fixed or filed reports against many of the...
PR
2002
15 years 13 days ago
2002
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...
125
Voted
BMCBI
2010
14 years 11 months ago
2010
Background: Large microarray datasets have enabled gene regulation to be studied through coexpression analysis. While numerous methods have been developed for identifying differen...