4926 search results - page 563 / 986 » Two Graph Algorithms On an Associative Computing Model |
135
click to vote
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
106
Voted
MIDDLEWARE
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper describes an event dissemination algorithm that impletopic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is...
172
click to vote
ICPR
2000
IEEE
15 years 7 months ago
2000
IEEE
A new concept and algorithm are presented for noniterative robust estimation of piecewise smooth curves of maximal edge strength in small image windows – typically ¢¡£ to...
153
click to vote
ICASSP
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...
124
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...