3220 search results - page 253 / 644 » Constrained Graph Processes |
167
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
The paper presents an algorithm to determine the close-tosmallest possible data buffer sizes for arbitrary synchronous data flow (SDF) applications, such that we can guarantee the...
180
click to vote
EUROPAR
1998
Springer
15 years 10 months ago
1998
Springer
This paper illustrates the use of a post-mortem call-graph profiling tool in the analysis of an SQL query processing application written using BSPIib [4]. Unlike other parallel pro...
171
click to vote
ACSC
2004
IEEE
15 years 10 months ago
2004
IEEE
Two important recent trends in military and civilian communications have been the increasing tendency to base operations around an internal network, and the increasing threats to ...
171
click to vote
CRV
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper presents a method that combines graphbased segmentation and multistage region merging to segment laparoscopic images. Starting with image preprocessing, including Gauss...
213
click to vote
SIGMETRICS
2012
ACM
13 years 9 months ago
2012
ACM
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...