9532 search results - page 379 / 1907 » Logic, Graphs, and Algorithms |
181
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v V (G). The pur...
204
click to vote
FORTE
2010
15 years 8 months ago
2010
Abstract. Separation logic is a popular specification language for imperative programs where the heap can only be mentioned through pointsto assertions. However, separation logic&#...
179
Voted
AIR
2006
15 years 6 months ago
2006
Recently, the problem of inconsistency handling in description logics has attracted a lot of attention. Many approaches have been proposed to deal with this problem based on existi...
187
click to vote
ISPD
2010
ACM
16 years 1 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
390
click to vote
PAMI
2010
15 years 5 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...