318 search results - page 33 / 64 » Distributed Graph Traversals by Relabelling Systems with App... |
124
click to vote
ICPPW
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— Most image processing applications are characterized by computation-intensive operations, and high memory and performance requirements. Parallelized implementation on s...
121
Voted
ISCAPDCS
2007
15 years 4 months ago
2007
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
141
Voted
ICDE
2010
IEEE
15 years 7 months ago
2010
IEEE
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
105
click to vote
CLUSTER
2005
IEEE
15 years 8 months ago
2005
IEEE
Cycle-harvesting systems such as Condor have been developed to make desktop machines in a local area (which are often similar to clusters in hardware configuration) available as ...
105
click to vote
CSR
2007
Springer
15 years 9 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...