Sciweavers

1404 search results - page 91 / 281
» Optimization problems in multiple-interval graphs
Sort
View
CVPR
2004
IEEE
15 years 12 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
FUIN
2006
139views more  FUIN 2006»
14 years 9 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
SDM
2012
SIAM
238views Data Mining» more  SDM 2012»
13 years 7 days ago
Evaluating Event Credibility on Twitter
Though Twitter acts as a realtime news source with people acting as sensors and sending event updates from all over the world, rumors spread via Twitter have been noted to cause c...
Manish Gupta, Peixiang Zhao, Jiawei Han
NETWORKS
2002
14 years 9 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
MASS
2010
159views Communications» more  MASS 2010»
14 years 4 months ago
Efficient WiFi deployment algorithms based on realistic mobility characteristics
Abstract--Recent years have witnessed the emergence of numerous new Internet services for mobile users. Supporting mobile applications via public WiFi networks has received signifi...
Tian Wang, Guoliang Xing, Minming Li, Weijia Jia