1133 search results - page 215 / 227 » Basics of Graph Cuts |
JMLR
2010
13 years 2 months ago
2010
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
SAC
2011
ACM
12 years 10 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
Publication
For quantitative analysis of histopathological images,
such as the lymphoma grading systems, quantification of
features is usually carried out on single cells before categorizing...
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
SASP
2008
IEEE
14 years 2 months ago
2008
IEEE
Different approaches have been proposed over the years for automatically transforming High-Level-Languages (HLL) descriptions of applications into custom hardware implementations. ...