Sciweavers

493 search results - page 34 / 99
» Graph Database Indexing Using Structured Graph Decomposition
Sort
View
JCST
2007
151views more  JCST 2007»
13 years 7 months ago
Indexing Future Trajectories of Moving Objects in a Constrained Network
Abstract Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic managemen...
Ji-Dong Chen, Xiao-Feng Meng
ICPR
2010
IEEE
13 years 11 months ago
Efficient Semantic Indexing for Image Retrieval
Semantic analysis of a document collection can be viewed as an unsupervised clustering of the constituent words and documents around hidden or latent concepts. This has shown to i...
Chandrika Pulla, Suman Karthik, C. V. Jawahar
CIKM
2005
Springer
14 years 1 months ago
Compact reachability labeling for graph-structured data
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...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
ICDAR
2011
IEEE
12 years 7 months ago
Symbol Spotting in Line Drawings through Graph Paths Hashing
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
Anjan Dutta, Josep Lladós, Umapada Pal
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
12 years 10 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon