Sciweavers

172 search results - page 29 / 35
» Planar Graphs with Topological Constraints
Sort
View
AUTOMATICA
2011
13 years 3 months ago
Distributed averaging on digital erasure networks
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
Ruggero Carli, Giacomo Como, Paolo Frasca, Federic...
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
13 years 12 months ago
Scheduling with Bully Selfish Jobs
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
Tami Tamir
TCC
2009
Springer
132views Cryptology» more  TCC 2009»
14 years 9 months ago
Authenticated Adversarial Routing
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
Yair Amir, Paul Bunn, Rafail Ostrovsky
MM
2006
ACM
119views Multimedia» more  MM 2006»
14 years 2 months ago
Model generation for video-based object recognition
This paper presents a novel approach to object recognition involving a sparse 2D model and matching using video. The model is generated on the basis of geometry and image measurab...
Humera Noor, Shahid H. Mirza, Yaser Sheikh, Amit J...
CVPR
2010
IEEE
13 years 10 months ago
Simultaneous Searching of Globally Optimal Interacting Surfaces with Shape Priors
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
Qi Song, Xiaodong Wu, Yunlong Liu, Mona Garvin, Mi...