1986 search results - page 233 / 398 » Path Separability of Graphs |
104
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
A lot of image analysis problems lend themselves to a unified mathematical formulation as optimization problems. Tree-serial dynamic programming is a particular case of the so-cal...
109
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper presents a Java framework based on separation of concerns and code generation concepts that facilitates development of concurrency and I/O in servers. In this approach,...
137
Voted
INFORMATICALT
2008
15 years 2 months ago
2008
In this paper, we present a method for describing the syntax and semantics of viewcharts. Viewcharts is a visual formalism for describing the dynamic behavior of system components....
108
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper presents a novel approach of multiple target tracking from multiple collaborative cameras. Firstly, particle filtering for conditional density propagation on graphs to...