3958 search results - page 209 / 792 » Dynamic Graph Algorithms with Applications |
175
click to vote
HIS
2008
15 years 8 months ago
2008
Online adaptation is a key requirement for image processing applications when used in dynamic environments. In contrast to batch learning, where retraining is required each time a...
185
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Vehicular Ad-Hoc networks (VANETs) play a critical role in enabling important active safety applications such as collision warning and vehicle tracking. The most pressin...
163
click to vote
JCO
2010
15 years 5 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
222
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
201
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...