Sciweavers

2498 search results - page 279 / 500
» Algorithms for the Topological Watershed
Sort
View
173
Voted
COMSIS
2010
15 years 3 months ago
3D point pattern matching based on spatial geometric flexibility
We propose a new method for matching two 3D point sets of identical cardinality with global similarity but local non-rigid deformations and distribution errors. This problem arises...
Xiaopeng Wei, Xiaoyong Fang, Qiang Zhang, Dongshen...
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
15 years 1 months ago
Asymmetric information diffusion via gossiping on static and dynamic networks
In this paper we consider the problem of gossiping in a network to diffuse the average of a sub-set of nodes, called sources, and directing it to another sub-set of nodes in the ne...
Mehmet Ercan Yildiz, Anna Scaglione, Asuman E. Ozd...
TWC
2011
291views more  TWC 2011»
15 years 1 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...
IJACTAICIT
2010
121views more  IJACTAICIT 2010»
15 years 28 days ago
Separation and Equalization of Cross-Coupled Signals by Adaptive Cancellation
This paper describes an adaptive noise cancellation structure suitable for the separation and equalization of signals that coupled due to the approximate placing of primary and au...
Manal Jamil Al-Kindi
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
14 years 9 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...