Sciweavers

1207 search results - page 94 / 242
» On distributed optimization using generalized gossip
Sort
View
SPAA
2005
ACM
15 years 9 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
PAMI
2008
109views more  PAMI 2008»
15 years 3 months ago
Likelihood Ratio-Based Biometric Score Fusion
Multibiometric systems fuse information from different sources to compensate for the limitations in performance of individual matchers. We propose a framework for optimal combinati...
Karthik Nandakumar, Yi Chen, Sarat C. Dass, Anil K...
MONET
2006
107views more  MONET 2006»
15 years 3 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao
CIE
2007
Springer
15 years 10 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
PODC
2012
ACM
13 years 6 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...