Sciweavers

62 search results - page 9 / 13
» Closed k-stop distance in graphs
Sort
View
AAAI
2010
13 years 9 months ago
Gaussian Mixture Model with Local Consistency
Gaussian Mixture Model (GMM) is one of the most popular data clustering methods which can be viewed as a linear combination of different Gaussian components. In GMM, each cluster ...
Jialu Liu, Deng Cai, Xiaofei He
ACCV
2010
Springer
13 years 2 months ago
Earth Mover's Morphing: Topology-Free Shape Morphing Using Cluster-Based EMD Flows
Abstract. This paper describes a method for topology-free shape morphing based on region cluster-based Earth Mover's Distance (EMD) flows, since existing methods for closed cu...
Yasushi Makihara, Yasushi Yagi
MOBIHOC
2005
ACM
14 years 7 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 9 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
AUTOMATICA
2007
88views more  AUTOMATICA 2007»
13 years 7 months ago
Three and higher dimensional autonomous formations: Rigidity, persistence and structural persistence
In this paper, we generalize the notion of persistence, which has been originally introduced for two-dimensional formations, to Rd for d 3, seeking to provide a theoretical framew...
Changbin Yu, Julien M. Hendrickx, Baris Fidan, Bri...