Sciweavers

750 search results - page 10 / 150
» Reconstruction for Models on Random Graphs
Sort
View
ISVC
2009
Springer
14 years 1 months ago
Graph Cut Based Point-Cloud Segmentation for Polygonal Reconstruction
The reconstruction of 3D objects from a point-cloud is based on sufficient separation of the points representing objects of interest from the points of other, unwanted objects. Thi...
David Sedlacek, Jiri Zara
CVPR
2009
IEEE
14 years 3 months ago
Random walks on graphs to model saliency in images
We formulate the problem of salient region detection in images as Markov random walks performed on images represented as graphs. While the global properties of the image are extra...
Viswanath Gopalakrishnan, Yiqun Hu, Deepu Rajan
KBSE
2005
IEEE
14 years 2 months ago
A context-sensitive structural heuristic for guided search model checking
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
Neha Rungta, Eric G. Mercer
RSA
2011
124views more  RSA 2011»
13 years 3 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
CSR
2007
Springer
14 years 2 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka