1018 search results - page 169 / 204 » On the minimization of XPath queries |
101
click to vote
MOBICOM
2004
ACM
15 years 5 months ago
2004
ACM
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
117
click to vote
WWW
2011
ACM
14 years 6 months ago
2011
ACM
This paper uses the URL word breaking task as an example to elaborate what we identify as crucialin designingstatistical natural language processing (NLP) algorithmsfor Web scale ...
101
click to vote
SPAA
2009
ACM
16 years 12 days ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
KDD
2007
ACM
16 years 8 days ago
2007
ACM
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
173
click to vote
SIGMOD
2008
ACM
16 years 4 hour ago
2008
ACM
We demonstrate XRPC, a minimal XQuery extension that enables distributed querying between heterogeneous XQuery engines. The XRPC language extension enhances the existing concept o...