780 search results - page 58 / 156 » Cost-Sharing Approximations for h |
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
113
click to vote
KDD
2008
ACM
15 years 11 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
103
click to vote
KDD
2008
ACM
15 years 11 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
107
click to vote
KDD
2000
ACM
15 years 2 months ago
2000
ACM
Data--call records, internet packet headers, or other transaction records--are coming down a pipe at a ferocious rate, and we need to monitor statistics of the data. There is no r...
105
click to vote
AIRWEB
2008
Springer
15 years 1 months ago
2008
Springer
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...