4926 search results - page 233 / 986 » Two Graph Algorithms On an Associative Computing Model |
194
click to vote
COMGEO
1999
ACM
15 years 6 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
179
click to vote
IPPS
2005
IEEE
16 years 15 hour ago
2005
IEEE
In this paper we propose two price-based job allocation schemes for computational grids. A grid system tries to solve problems submitted by various grid users by allocating the jo...
155
click to vote
ICASSP
2008
IEEE
16 years 26 days ago
2008
IEEE
In the symbol recognition stage of online handwritten math expression recognition, the one-pass dynamic programming algorithm can produce high-quality symbol graphs in addition of...
152
click to vote
ICCS
2005
Springer
15 years 12 months ago
2005
Springer
We are presenting a progress overview associated with our work on a data-driven environment for multiphysics applications (DDEMA). In this paper, we emphasize the dynamic-data-driv...
208
click to vote
FOSSACS
2011
Springer
14 years 10 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...