Sciweavers

31 search results - page 2 / 7
» Interleaved Sampling
Sort
View
AAAI
2004
13 years 6 months ago
Towards Efficient Sampling: Exploiting Random Walk Strategies
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
Wei Wei, Jordan Erenrich, Bart Selman
AMEC
2003
Springer
13 years 10 months ago
Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
William E. Walsh, David C. Parkes, Rajarshi Das
NIPS
2007
13 years 6 months ago
Nearest-Neighbor-Based Active Learning for Rare Category Detection
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
Jingrui He, Jaime G. Carbonell
JSAC
2006
95views more  JSAC 2006»
13 years 5 months ago
A low-rate code-spread and chip-interleaved time-hopping UWB system
We consider a code-spread and chip-interleaved time-hopping (TH) multiple-access scheme for multiuser ultra-wideband (UWB) communications. In such a system, each user's chip s...
Kai Li, Xiaodong Wang, Guosen Yue, Li Ping
NIPS
1997
13 years 6 months ago
Active Data Clustering
Active data clustering is a novel technique for clustering of proximity data which utilizes principles from sequential experiment design in order to interleave data generation and...
Thomas Hofmann, Joachim M. Buhmann