Sciweavers

3958 search results - page 214 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
CVPR
2005
IEEE
16 years 8 months ago
Illumination-Invariant Tracking via Graph Cuts
Illumination changes are a ubiquitous problem in computer vision. They present a challenge in many applications, including tracking: for example, an object may move in and out of ...
Daniel Freedman, Matthew W. Turek
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
16 years 18 days ago
Mining for Tree-Query Associations in a Graph
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
Eveline Hoekx, Jan Van den Bussche
GD
2008
Springer
15 years 7 months ago
Succinct Greedy Graph Drawing in the Hyperbolic Plane
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
David Eppstein, Michael T. Goodrich
DEBS
2003
ACM
15 years 11 months ago
Introducing reliability in content-based publish-subscribe through epidemic algorithms
Distributed content-based publish-subscribe middleware provides the necessary decoupling, flexibility, expressiveness, and scalability required by modern distributed applications...
Paolo Costa, Matteo Migliavacca, Gian Pietro Picco...
ICALP
1995
Springer
15 years 10 months ago
Shortest Path Queries in Digraphs of Small Treewidth
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be ef...
Shiva Chaudhuri, Christos D. Zaroliagis