Sciweavers

650 search results - page 83 / 130
» Positive graphs
Sort
View
IWOCA
2009
Springer
193views Algorithms» more  IWOCA 2009»
14 years 4 months ago
Gray Code Compression
An n-bit (cyclic) Gray code is a (cyclic) sequence of all n-bit strings such that consecutive strings differ in a single bit. We describe an algorithm which for every positive int...
Darko Dimitrov, Tomás Dvorák, Petr G...
ICW
2005
IEEE
143views Communications» more  ICW 2005»
14 years 3 months ago
Distributed Mobility Control for Fault-Tolerant Mobile Networks
Large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be foreseeable in the near future. Since nodes in such a system commun...
Jie Lin
MCPR2
2011
104views more  MCPR2 2011»
13 years 23 days ago
People Detection Using Color and Depth Images
We present a strategy that combines color and depth images to detect people in indoor environments. Similarity of image appearance and closeness in 3D position over time yield weig...
Joaquín Salas, Carlo Tomasi
SEMWEB
2009
Springer
14 years 4 months ago
Analysis of a Real Online Social Network Using Semantic Web Frameworks
Abstract. Social Network Analysis (SNA) provides graph algorithms to characterize the structure of social networks, strategic positions in these networks, specific sub-networks and...
Guillaume Erétéo, Michel Buffa, Fabi...
SIAMJO
2010
110views more  SIAMJO 2010»
13 years 4 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng