1133 search results - page 140 / 227 » Basics of Graph Cuts |
WADT
1997
Springer
15 years 2 months ago
1997
Springer
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...
CIIA
2009
14 years 11 months ago
2009
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
108
click to vote
TIP
2010
14 years 8 months ago
2010
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
100
click to vote
WWW
2007
ACM
15 years 10 months ago
2007
ACM
Ontology summarization is very important to quick understanding and selection of ontologies. In this paper, we study extractive summarization of ontology. We propose a notion of R...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...