Sciweavers

1605 search results - page 160 / 321
» On Partitional Labelings of Graphs
Sort
View
ISCSCT
2008
IEEE
14 years 4 months ago
Large Scale Scenes Reconstruction from Multiple Views
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...
Limin Shi, Feng Zhang, Zhenhui Xu, Zhanyi Hu
DM
2006
86views more  DM 2006»
13 years 10 months ago
Minimal rankings and the arank number of a path
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
Victor Kostyuk, Darren A. Narayan, Victoria A. Wil...
PAMI
2006
440views more  PAMI 2006»
13 years 10 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
ACL
2011
13 years 2 months ago
Semi-Supervised Frame-Semantic Parsing for Unknown Predicates
We describe a new approach to disambiguating semantic frames evoked by lexical predicates previously unseen in a lexicon or annotated data. Our approach makes use of large amounts...
Dipanjan Das, Noah A. Smith
DCOSS
2010
Springer
14 years 1 months ago
Fast Decentralized Averaging via Multi-scale Gossip
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
Konstantinos I. Tsianos, Michael G. Rabbat