4009 search results - page 320 / 802 » Clustering on Complex Graphs |
177
click to vote
ICDCS
2011
IEEE
14 years 6 months ago
2011
IEEE
— In the emerging cloud computing paradigm, data owners become increasingly motivated to outsource their complex data management systems from local sites to the commercial public...
175
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
This paper presents a novel method for real-time tracking of objects in video sequences. Tracking is performed using the so-called Morphological Elastic Graph Matching algorithm. ...
273
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
In this demonstration, we present a database over complex documents, which, in addition to a structured text content, also has update information, annotations, and embedded object...
160
click to vote
ESA
2004
Springer
16 years 3 days ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
144
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
We consider the power of single level circuits in the context of graph complexity. We first prove that the single level conjecture fails for fanin-2 circuits over the basis {, , 1...