2434 search results - page 292 / 487 » Algorithmic Randomness of Closed Sets |
126
Voted
IISWC
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— Data mining constitutes an important class of scientific and commercial applications. Recent advances in data extraction techniques have created vast data sets, which ...
145
Voted
MICAI
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
117
click to vote
IJCNLP
2004
Springer
15 years 9 months ago
2004
Springer
We study the problem of efficiently removing equal frequency n-gram substrings from an n-gram set, formally called Statistical Substring Reduction (SSR). SSR is a useful operatio...
139
Voted
ESA
2009
Springer
15 years 8 months ago
2009
Springer
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
124
click to vote
CCCG
1993
15 years 5 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...