4972 search results - page 344 / 995 » Ranking on graph data |
152
click to vote
DEBU
2010
15 years 7 months ago
2010
A major hardness of processing searches issued in the form of keywords on structured data is the ambiguity problem. A set of keywords itself is not a complete piece of information...
220
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the stri...
199
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Image features are widely used in computer vision applications. They need to be robust to scene changes and image transformations. Designing and comparing feature descriptors requ...
202
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
186
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...