Sciweavers

2434 search results - page 172 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
IPPS
1997
IEEE
15 years 7 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
EMNLP
2009
15 years 1 months ago
Model Adaptation via Model Interpolation and Boosting for Web Search Ranking
This paper explores two classes of model adaptation methods for Web search ranking: Model Interpolation and error-driven learning approaches based on a boosting algorithm. The res...
Jianfeng Gao, Qiang Wu, Chris Burges, Krysta Marie...
141
Voted
AVSS
2006
IEEE
15 years 10 months ago
Nonparametric Background Modeling Using the CONDENSATION Algorithm
Background modeling for dynamic scenes is an important problem in the context of real time video surveillance systems. Several nonparametric background models have been proposed t...
Xingzhi Luo, Suchendra M. Bhandarkar, Wei Hua, Hai...
FUIN
2010
268views more  FUIN 2010»
14 years 10 months ago
Boruta - A System for Feature Selection
Machine learning methods are often used to classify objects described by hundreds of attributes; in many applications of this kind a great fraction of attributes may be totally irr...
Miron B. Kursa, Aleksander Jankowski, Witold R. Ru...
154
Voted
AAAI
2011
14 years 3 months ago
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
Kalev Kask, Andrew Gelfand, Lars Otten, Rina Decht...