Sciweavers

909 search results - page 76 / 182
» Performance Evaluation of the VF Graph Matching Algorithm
Sort
View
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
15 years 7 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
CVPR
2005
IEEE
16 years 3 months ago
Bi-Layer Segmentation of Binocular Stereo Video
This paper describes two algorithms capable of real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/co...
Vladimir Kolmogorov, Antonio Criminisi, Andrew Bla...
CIKM
2009
Springer
15 years 8 months ago
Graph classification based on pattern co-occurrence
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual p...
Ning Jin, Calvin Young, Wei Wang
PRDC
2006
IEEE
15 years 7 months ago
Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
Hakem Beitollahi, Geert Deconinck
JACM
2006
134views more  JACM 2006»
15 years 1 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich