Sciweavers

592 search results - page 110 / 119
» Crossing numbers of random graphs
Sort
View
ACCV
2010
Springer
13 years 2 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool
TMC
2011
201views more  TMC 2011»
13 years 2 months ago
Data Delivery Properties of Human Contact Networks
—Pocket Switched Networks take advantage of social contacts to opportunistically create data paths over time. This work employs empirical traces to examine the effect of the huma...
Nishanth Sastry, D. Manjunath, Karen R. Sollins, J...
TIP
2010
129views more  TIP 2010»
13 years 2 months ago
Image Segmentation by MAP-ML Estimations
Abstract--Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probabilit...
Shifeng Chen, Liangliang Cao, Yueming Wang, Jianzh...
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 8 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 8 months ago
A probabilistic framework for relational clustering
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu