Sciweavers

619 search results - page 23 / 124
» A dynamical systems approach to weighted graph matching
Sort
View
JGAA
2000
179views more  JGAA 2000»
13 years 7 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
CVPR
2009
IEEE
15 years 2 months ago
Stereo Matching with Nonparametric Smoothness Priors in Feature Space
We propose a novel formulation of stereo matching that considers each pixel as a feature vector. Under this view, matching two or more images can be cast as matching point clouds i...
Brandon M. Smith, Hailin Jin, Li Zhang
WWW
2006
ACM
14 years 8 months ago
Semantic WS-agreement partner selection
In a dynamic service oriented environment it is desirable for service consumers and providers to offer and obtain guarantees regarding their capabilities and requirements. WS-Agre...
Nicole Oldham, Kunal Verma, Amit P. Sheth, Farshad...
HIPEAC
2007
Springer
14 years 1 months ago
Fetch Gating Control Through Speculative Instruction Window Weighting
In a dynamic reordering superscalar processor, the front-end fetches instructions and places them in the issue queue. Instructions are then issued by the back-end execution core. T...
Hans Vandierendonck, André Seznec
KDD
2009
ACM
132views Data Mining» more  KDD 2009»
14 years 8 months ago
Learning patterns in the dynamics of biological networks
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
Chang Hun You, Lawrence B. Holder, Diane J. Cook