299 search results - page 28 / 60 » On Graph Query Optimization in Large Networks |
203
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
131
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
148
click to vote
PAMI
2007
15 years 1 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
111
click to vote
VLDB
2004
ACM
15 years 7 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
133
click to vote
ICDE
2010
IEEE
15 years 8 months ago
2010
IEEE
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...