4972 search results - page 671 / 995 » Ranking on graph data |
187
click to vote
SIGADA
1999
Springer
15 years 11 months ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
229
click to vote
TSMC
2010
15 years 1 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
238
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
261
click to vote
ICDE
2000
IEEE
16 years 8 months ago
2000
IEEE
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
197
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...