4972 search results - page 237 / 995 » Ranking on graph data |
169
click to vote
WSC
2008
15 years 9 months ago
2008
This paper presents a new method to identify and rank the bottlenecks in a manufacturing system. The proposed method is based on performance related data that are easy to capture,...
172
click to vote
DMIN
2009
15 years 4 months ago
2009
- This paper demonstrates how methods borrowed from information fusion can improve the performance of a classifier by constructing (i.e., fusing) new features that are combinations...
155
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
177
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
201
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...