5316 search results - page 964 / 1064 » Which Search Problems Are Random |
135
click to vote
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
112
Voted
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
Micro-data protection is a hot topic in the field of Statistical Disclosure Control (SDC), that has gained special interest after the disclosure of 658000 queries by the AOL searc...
167
Voted
WSDM
2010
ACM
16 years 29 days ago
2010
ACM
This paper focuses on the problem of identifying influential users of micro-blogging services. Twitter, one of the most notable micro-blogging services, employs a social-networkin...
145
Voted
CIVR
2009
Springer
15 years 10 months ago
2009
Springer
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
109
Voted
CIKM
2007
Springer
15 years 9 months ago
2007
Springer
We present Paged Graph Visualization (PGV), a new semiautonomous tool for RDF data exploration and visualization. PGV consists of two main components: a) the “PGV explorer” an...