Sciweavers

145 search results - page 16 / 29
» The Maximum Distinguishing Number of a Group
Sort
View
TCOM
2008
103views more  TCOM 2008»
14 years 9 months ago
On the design of uplink and downlink group-orthogonal multicarrier wireless systems
Abstract--Group-orthogonal multicarrier code-division multiple access (GO-MC-CDMA) has been proposed as an attractive mutiplexing technique for the uplink segment of wireless syste...
Felip Riera-Palou, Guillem Femenias, Jaume Ramis
ANOR
2002
77views more  ANOR 2002»
14 years 9 months ago
Conditional Median: A Parametric Solution Concept for Location Problems
Classical approaches to location problems are based on the minimization of the average distance (the median concept) or the minimization of the maximum distance (the center concept...
Wlodzimierz Ogryczak, Mariusz Zawadzki
JSAC
2010
120views more  JSAC 2010»
14 years 8 months ago
A simple and scalable algorithm for alignment in broadcast networks
We consider the problem of coordinating a group of mobile nodes communicating through a wireless medium. The objective of the network is the alignment of all the nodes towards a c...
Roberto Pagliari, Mehmet E. Yildiz, Shrut Kirti, K...
ICCV
2003
IEEE
15 years 11 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu
EWSN
2007
Springer
15 years 9 months ago
An Energy-Efficient K-Hop Clustering Framework for Wireless Sensor Networks
Many applications in wireless sensor networks (WSNs) benefit significantly from organizing nodes into groups, called clusters, because data aggregation and data filtering applied i...
Quanbin Chen, Jian Ma, Yanmin Zhu, Dian Zhang, Lio...