2229 search results - page 91 / 446 » The Case for Grounding Databases |
123
click to vote
VLDB
1991
ACM
15 years 5 months ago
1991
ACM
: This paper describes a design methodology for an object oriented database,basedon a semantic network. This approach is based on the assumption that Yemanticdata models are more p...
106
click to vote
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
Client/server information systems use caching techniques to reduce the volume of transmitted data as well as response time and, especially in the case of systems with mobile clien...
ICCV
1998
IEEE
16 years 3 months ago
1998
IEEE
Proceedings of the 1998 IEEE International Conference on Computer Vision, Bombay, India We introduce a new distance between two distributions that we call the Earth Mover's D...
220
click to vote
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
132
click to vote
KDD
2004
ACM
16 years 2 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...