32545 search results - page 584 / 6509 » Data Structures and Algorithms |
202
Voted
CINQ
2004
Springer
16 years 20 days ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
213
click to vote
VLDB
2004
ACM
16 years 19 days ago
2004
ACM
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
202
Voted
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
200
click to vote
ESA
2010
Springer
15 years 8 months ago
2010
Springer
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
225
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...