Sciweavers

3008 search results - page 444 / 602
» Independence in connected graphs
Sort
View
ECCV
2010
Springer
16 years 2 days ago
Weakly Supervised Shape Based Object Detection with Particle Filter
Abstract. We describe an efficient approach to construct shape models composed of contour parts with partially-supervised learning. The proposed approach can easily transfer parts ...
NOSSDAV
2010
Springer
15 years 11 months ago
Second life: a social network of humans and bots
Second Life (SL) is a virtual world where people interact and socialize through virtual avatars. Avatars behave similarly to their human counterparts in real life and naturally de...
Matteo Varvello, Geoffrey M. Voelker
PG
2000
IEEE
15 years 11 months ago
Morphing Using Curves and Shape Interpolation Techniques
This paper presents solutions to the feature correspondence and feature interpolation problems in image morphing. The user specifies the correspondence between the source and the...
Henry Johan, Yuichi Koiso, Tomoyuki Nishita
PPSN
1992
Springer
15 years 11 months ago
Hyperplane Annealing and Activator-Inhibitor-Systems
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
Thomas Laußermair
ASPDAC
2001
ACM
103views Hardware» more  ASPDAC 2001»
15 years 10 months ago
Efficient minimum spanning tree construction without Delaunay triangulation
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Hai Zhou, Narendra V. Shenoy, William Nicholls