3068 search results - page 86 / 614 » Clustering with Multiple Graphs |
137
Voted
CCGRID
2008
IEEE
15 years 2 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
105
click to vote
ECML
2006
Springer
15 years 4 months ago
2006
Springer
Multiple-instance learning (MIL) is a popular concept among the AI community to support supervised learning applications in situations where only incomplete knowledge is available....
72
Voted
ICIP
2010
IEEE
14 years 10 months ago
2010
IEEE
Copy-move forgeries are parts of the image that are duplicated elsewhere into the same image, often after being modified by geometrical transformations. In this paper we present a...
102
Voted
ICPADS
2006
IEEE
15 years 6 months ago
2006
IEEE
While most parallel task graphs scheduling research has been done in the context of single homogeneous clusters, heterogeneous platforms have become prevalent and are extremely at...
100
click to vote
AAAI
2008
15 years 2 months ago
2008
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...