Sciweavers

401 search results - page 45 / 81
» Sparse Quasi-Random Graphs
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Learning GMRF Structures for Spatial Priors
The goal of this paper is to find sparse and representative spatial priors that can be applied to part-based object localization. Assuming a GMRF prior over part configurations, w...
Lie Gu, Eric P. Xing, Takeo Kanade
ICALP
2009
Springer
14 years 2 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
ECCC
2006
70views more  ECCC 2006»
13 years 7 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas
MM
2009
ACM
277views Multimedia» more  MM 2009»
14 years 2 months ago
Inferring semantic concepts from community-contributed images and noisy tags
In this paper, we exploit the problem of inferring images’ semantic concepts from community-contributed images and their associated noisy tags. To infer the concepts more accura...
Jinhui Tang, Shuicheng Yan, Richang Hong, Guo-Jun ...
IBPRIA
2007
Springer
14 years 1 months ago
Bayesian Hyperspectral Image Segmentation with Discriminative Class Learning
Abstract. This paper presents a new Bayesian approach to hyperspectral image segmentation that boosts the performance of the discriminative classifiers. This is achieved by combin...
Janete S. Borges, José M. Bioucas-Dias, And...