2004 search results - page 170 / 401 » Sampling from large graphs |
114
Voted
SIAMDM
2010
15 years 1 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
151
click to vote
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
142
Voted
KDD
2008
ACM
16 years 3 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
231
click to vote
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
135
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...