611 search results - page 63 / 123 » Querying Tree-Structured Data Using Dimension Graphs |
HPDC
2003
IEEE
14 years 3 months ago
2003
IEEE
The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important in large, decentralized, resource sharing distri...
CORR
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
DBA
2004
13 years 11 months ago
2004
This paper discusses how to extend the applicability of the recursive cascade update command of the Xplain query language. This command guarantees termination because cycle detect...
CIKM
2005
Springer
14 years 3 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
PAMI
2012
12 years 16 days ago
2012
—There has been a growing interest in exploiting contextual information in addition to local features to detect and localize multiple object categories in an image. A context mod...