2314 search results - page 161 / 463 » Minimal Partitions of a Graph |
115
click to vote
AAAI
2007
15 years 6 months ago
2007
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
133
click to vote
CIVR
2005
Springer
15 years 9 months ago
2005
Springer
This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normali...
119
click to vote
ECAL
2003
Springer
15 years 9 months ago
2003
Springer
We present a general method for evaluating and visualizing evolutionary dynamics of self-replicators using a graph-based representation for genealogy. Through a transformation from...
118
Voted
ICCAD
2001
IEEE
16 years 26 days ago
2001
IEEE
SPFDs are a mechanism to express flexibility in Boolean networks. Introduced by Yamashita et al. in the context of FPGA synthesis [4], they were extended later to general combina...
111
click to vote
ISSS
1997
IEEE
15 years 8 months ago
1997
IEEE
Given a hardware/software partitioned specification and an allocation (number and type) of processors, we present an algorithm to (1) map each of the software behaviors (or tasks...