Sciweavers

1914 search results - page 156 / 383
» Evaluation of a Catalytic Search Algorithm
Sort
View
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
14 years 7 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
WAIM
2010
Springer
14 years 8 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le
SIGMOD
2010
ACM
189views Database» more  SIGMOD 2010»
15 years 2 months ago
Recsplorer: recommendation algorithms based on precedence mining
We study recommendations in applications where there are temporal patterns in the way items are consumed or watched. For example, a student who has taken the Advanced Algorithms c...
Aditya G. Parameswaran, Georgia Koutrika, Benjamin...
BMCBI
2006
201views more  BMCBI 2006»
14 years 10 months ago
Gene selection algorithms for microarray data based on least squares support vector machine
Background: In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary ...
E. Ke Tang, Ponnuthurai N. Suganthan, Xin Yao
AAAI
1990
14 years 11 months ago
A Proven Domain-Independent Scientific Function-Finding Algorithm
Programs such as Bacon, Abacus, Coper, Kepler and others are designed to find functional relationships of scientific significance in numerical data without relying on the deep dom...
Cullen Schaffer