1963 search results - page 363 / 393 » The Maximum Solution Problem on Graphs |
178
click to vote
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
108
Voted
PODC
2005
ACM
15 years 6 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
111
click to vote
PLDI
2004
ACM
15 years 6 months ago
2004
ACM
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
101
click to vote
AAAI
2010
15 years 2 months ago
2010
Lifted inference, handling whole sets of indistinguishable objects together, is critical to the effective application of probabilistic relational models to realistic real world ta...
131
click to vote
NIPS
2001
15 years 2 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...