2503 search results - page 67 / 501 » A study of 3-arc graphs |
155
click to vote
ICDM
2008
IEEE
16 years 12 days ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
147
click to vote
APPROX
2009
Springer
16 years 17 days ago
2009
Springer
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
245
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
Abstract-- Communications between individuals can be represented by (weighted, multi-) graphs. Many applications operate on communication graphs associated with telephone calls, em...
167
click to vote
DASFAA
2010
IEEE
15 years 11 months ago
2010
IEEE
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
176
click to vote
DAM
2000
15 years 5 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...