5100 search results - page 357 / 1020 » The Linear Complexity of a Graph |
170
click to vote
PAKDD
2001
ACM
15 years 10 months ago
2001
ACM
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
166
Voted
MP
2007
15 years 5 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
156
click to vote
ICIP
2005
IEEE
16 years 7 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. ...
261
Voted
ICDE
2005
IEEE
16 years 7 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...
147
click to vote
ESA
2004
Springer
15 years 11 months 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 ...