3016 search results - page 285 / 604 » A Granular Approach to Web Search Result Presentation |
146
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, we study the problem of Web forum crawling. Web forum has now become an important data source of many Web applications; while forum crawling is still a challenging ...
179
click to vote
MICAI
2005
Springer
16 years 8 days 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...
177
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...
196
click to vote
SPIESR
1997
15 years 8 months ago
1997
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
166
click to vote
JCIT
2010
15 years 1 months ago
2010
For stationary or quasi-stationary frames of a video sequence, traditional block matching algorithms (BMA) will easily lead the search to be trapped into a local minimum. In this ...