329 search results - page 29 / 66 » Efficient Parallel Query Processing by Graph Ranking |
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
ICSM
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper is a summary of the author’s thesis that presents a model and an environment for recovering the high level design of legacy software systems based on user defined ar...
CVPR
2010
IEEE
14 years 24 days ago
2010
IEEE
We present an efficient and scalable technique for spatiotemporal segmentation of long video sequences using a hierarchical graph-based algorithm. We begin by oversegmenting a vol...
ESWS
2009
Springer
13 years 6 months ago
2009
Springer
Many applications operate on time-sensitive data. Some of these data are only valid for certain intervals (e.g., job-assignments, versions of software code), others describe tempor...
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...