2875 search results - page 563 / 575 » Information Retrieval in Structured Domains |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
In large social networks, nodes (users, entities) are influenced by others for various reasons. For example, the colleagues have strong influence on one's work, while the fri...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
Virtually all proposals for querying XML include a class of query we term "containment queries". It is also clear that in the foreseeable future, a substantial amount of...