Sciweavers

49 search results - page 2 / 10
» Matchings in colored bipartite networks
Sort
View
GLOBECOM
2008
IEEE
13 years 7 months ago
Cooperative Spectrum Allocation in Centralized Cognitive Networks Using Bipartite Matching
—Conflict free spectrum allocation for secondary users in cognitive networks is a challenging problem, since the accessible spectrum is shared among users. The problem becomes to...
Chengshi Zhao, Mingrui Zou, Bin Shen, Bumjung Kim,...
ICB
2009
Springer
156views Biometrics» more  ICB 2009»
13 years 4 months ago
Bipartite Biotokens: Definition, Implementation, and Analysis
Abstract. Cryptographic transactions form the basis of many common security systems found throughout computer networks. Supporting these transactions with biometrics is very desira...
Walter J. Scheirer, Terrance E. Boult
APPROX
2004
Springer
149views Algorithms» more  APPROX 2004»
13 years 11 months ago
Edge Coloring with Delays
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
Noga Alon, Vera Asodi
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
13 years 4 months ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
DAM
2006
116views more  DAM 2006»
13 years 6 months ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...