Sciweavers

427 search results - page 42 / 86
» Computing the Local Consensus of Trees
Sort
View
154
Voted
DCOSS
2006
Springer
15 years 8 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
ICCV
2009
IEEE
15 years 2 months ago
SCRAMSAC: Improving RANSAC's efficiency with a spatial consistency filter
Geometric verification with RANSAC has become a crucial step for many local feature based matching applications. Therefore, the details of its implementation are directly relevant...
Torsten Sattler, Bastian Leibe, Leif Kobbelt
CORR
2011
Springer
204views Education» more  CORR 2011»
14 years 11 months ago
Accelerated Dual Descent for Network Optimization
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
Michael Zargham, A. Ribeiro, Ali Jadbabaie, Asuman...
CVPR
2012
IEEE
13 years 7 months ago
Globally optimal line clustering and vanishing point estimation in Manhattan world
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...
Jean Charles Bazin, Yongduek Seo, Cédric De...
DAGSTUHL
2007
15 years 6 months ago
Multi-Aspect Tagging for Collaborative Structuring
Local tag structures have become frequent through Web 2.0: Users "tag" their data without specifying the underlying semantics. Every user annotates items in an individual...
Katharina Morik, Michael Wurst