Sciweavers

217 search results - page 19 / 44
» Approximating Minimum Manhattan Networks
Sort
View
IPPS
2005
IEEE
15 years 9 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
15 years 3 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
160
Voted
ECAI
2010
Springer
15 years 28 days ago
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
Qiang Lou, Zoran Obradovic
151
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Gaussian mixture modeling for source localization
Exploiting prior knowledge, we use Bayesian estimation to localize a source heard by a fixed sensor network. The method has two main aspects: Firstly, the probability density fun...
John T. Flåm, Joakim Jalden, Saikat Chatterj...
138
Voted
COCOON
2005
Springer
15 years 9 months ago
Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks
Orthogonal Variable Spreading Factor (OVSF) CDMA code has the ability to support higher and variable data rates with a single code using one transceiver. A number of CDMA code ass...
Xiang-Yang Li, Peng-Jun Wan