Sciweavers

814 search results - page 141 / 163
» Graphical Models for Graph Matching
Sort
View
MM
2006
ACM
103views Multimedia» more  MM 2006»
14 years 2 months ago
Progressive cut
Recently, interactive image cutout technique becomes prevalent for image segmentation problem due to its easy-to-use nature. However, most existing stroke-based interactive object...
Chao Wang, Qiong Yang, Mo Chen, Xiaoou Tang, Zhong...
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 9 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
CIVR
2007
Springer
192views Image Analysis» more  CIVR 2007»
14 years 3 months ago
Texture retrieval based on a non-parametric measure for multivariate distributions
In the present study, an efficient strategy for retrieving texture images from large texture databases is introduced and studied within a distributional-statistical framework. Our...
Vasileios K. Pothos, Christos Theoharatos, George ...
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 6 months ago
Resource Minimization for Fire Containment
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
Parinya Chalermsook, Julia Chuzhoy
BIRTHDAY
2010
Springer
13 years 10 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman