Sciweavers

351 search results - page 48 / 71
» An exact method for graph coloring
Sort
View
VLSM
2005
Springer
14 years 1 months ago
Trimap Segmentation for Fast and User-Friendly Alpha Matting
Abstract. Given an image, digital matting consists in extracting a foreground element from the background. Standard methods are initialized with a trimap, a partition of the image ...
Olivier Juan, Renaud Keriven
MM
2006
ACM
103views Multimedia» more  MM 2006»
14 years 1 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...
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 7 months ago
Network-based consensus averaging with general noisy channels
This paper focuses on the consensus averaging problem on graphs under general noisy channels. We study a particular class of distributed consensus algorithms based on damped updat...
Ram Rajagopal, Martin J. Wainwright
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 10 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
13 years 5 months ago
Continuous Subgraph Pattern Search over Graph Streams
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
Changliang Wang, Lei Chen 0002