Sciweavers

206 search results - page 3 / 42
» Efficient adaptive collect using randomization
Sort
View
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
14 years 1 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
CDC
2010
IEEE
112views Control Systems» more  CDC 2010»
13 years 3 months ago
An overview of recent results on the identification of sparse channels using random probes
In this paper, we collect and discuss some of the recent theoretical results on channel identification using a random probe sequence. These results are part of the body of work kno...
Justin Romberg
GLOBECOM
2006
IEEE
14 years 2 months ago
Adaptive Network Resource Management in IEEE 802.11 Wireless Random Access MAC
— Effective and efficient management of wireless network resources is attracting more and more research attention, due to the rapid growing deployment of wireless mesh and ad hoc...
Hao Wang, Changcheng Huang, James Yan
ECCV
2006
Springer
14 years 10 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...
KDD
2005
ACM
146views Data Mining» more  KDD 2005»
14 years 9 months ago
Anonymity-preserving data collection
Protection of privacy has become an important problem in data mining. In particular, individuals have become increasingly unwilling to share their data, frequently resulting in in...
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright