112 search results - page 17 / 23 » Succinct Data Structures for Retrieval and Approximate Membe... |
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-nega...
AIRWEB
2008
Springer
15 years 3 days 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...
109
click to vote
TKDE
2012
13 years 15 days ago
2012
—In a traditional keyword-search system over XML data, a user composes a keyword query, submits it to the system, and retrieves relevant answers. In the case where the user has l...
TKDE
2010
14 years 8 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...