Sciweavers

72 search results - page 13 / 15
» A Fully Implicit Algorithm for Exact State Minimization
Sort
View
ICCV
2011
IEEE
12 years 5 months ago
Localized Principal Component Analysis based Curve Evolution: A Divide and Conquer Approach
We propose a novel localized principal component analysis (PCA) based curve evolution approach which evolves the segmenting curve semi-locally within various target regions (divis...
Vikram Appia, Balaji Ganapathy, Tracy Faber, Antho...
CVPR
2012
IEEE
11 years 8 months ago
Multi-class cosegmentation
Bottom-up, fully unsupervised segmentation remains a daunting challenge for computer vision. In the cosegmentation context, on the other hand, the availability of multiple images ...
Armand Joulin, Francis Bach, Jean Ponce
TALG
2010
158views more  TALG 2010»
13 years 14 days ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
WDAG
2007
Springer
73views Algorithms» more  WDAG 2007»
13 years 12 months ago
On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
Consider a distributed network of n nodes that is connected to a global source of “beats”. All nodes receive the “beats” simultaneously, and operate in lock-step. A scheme ...
Danny Dolev, Ezra N. Hoch
ADHOC
2007
144views more  ADHOC 2007»
13 years 5 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac