Sciweavers

909 search results - page 85 / 182
» Performance Evaluation of the VF Graph Matching Algorithm
Sort
View
KDD
2008
ACM
257views Data Mining» more  KDD 2008»
16 years 1 months ago
Knowledge discovery of semantic relationships between words using nonparametric bayesian graph model
We developed a model based on nonparametric Bayesian modeling for automatic discovery of semantic relationships between words taken from a corpus. It is aimed at discovering seman...
Issei Sato, Minoru Yoshida, Hiroshi Nakagawa
CVPR
2010
IEEE
15 years 9 months ago
Parallel and Distributed Graph Cuts by Dual Decomposition
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
Petter Strandmark, Fredrik Kahl
IWCMC
2010
ACM
15 years 3 months ago
Decentralized service composition in pervasive computing environments
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...
Joanna Izabela Siebert, Jiannong Cao, Long Cheng, ...
ICC
2009
IEEE
157views Communications» more  ICC 2009»
15 years 8 months ago
A Graph Approach to Dynamic Fractional Frequency Reuse (FFR) in Multi-Cell OFDMA Networks
A graph-based framework for dynamic fractional frequency reuse (FFR) in multi-cell OFDMA networks is proposed in this work. FFR is a promising resource allocation technique that c...
Ronald Chang, Zhifeng Tao, Jinyun Zhang, C.-C. Jay...
MOBIHOC
2008
ACM
16 years 1 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li