Sciweavers

5138 search results - page 253 / 1028
» Low-Entropy Set Selection.
Sort
View
OL
2011
277views Neural Networks» more  OL 2011»
15 years 1 months ago
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
TMI
2010
158views more  TMI 2010»
15 years 1 months ago
Estimation of Diffusion Properties in Crossing Fiber Bundles
Abstract--There is an ongoing debate on how to model diffusivity in fiber crossings. We propose an optimization framework for the selection of a dual tensor model and the set of di...
Matthan W. A. Caan, Ganesh Khedoe, Dirk H. J. Poot...
FCT
2005
Springer
16 years 5 days ago
Almost Optimal Explicit Selectors
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
Bogdan S. Chlebus, Dariusz R. Kowalski
DATE
2003
IEEE
98views Hardware» more  DATE 2003»
15 years 12 months ago
On the Characterization of Hard-to-Detect Bridging Faults
We investigate a characterization of hard-to-detect bridging faults. For circuits with large numbers of lines (or nodes), this characterization can be used to select target faults...
Irith Pomeranz, Sudhakar M. Reddy, Sandip Kundu
NIPS
2007
15 years 8 months ago
Discriminative K-means for Clustering
We present a theoretical study on the discriminative clustering framework, recently proposed for simultaneous subspace selection via linear discriminant analysis (LDA) and cluster...
Jieping Ye, Zheng Zhao, Mingrui Wu