1952 search results - page 309 / 391 » Complete partitions of graphs |
155
click to vote
TII
2010
14 years 11 months ago
2010
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...
160
click to vote
ICDE
2012
IEEE
13 years 7 months ago
2012
IEEE
Abstract—This paper revisits the classical problem of multiquery optimization in the context of RDF/SPARQL. We show that the techniques developed for relational and semi-structur...
141
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
164
Voted
IWCIA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
151
click to vote
IROS
2007
IEEE
15 years 11 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...