Sciweavers

526 search results - page 32 / 106
» Increments of Random Partitions
Sort
View
TIT
2010
61views Education» more  TIT 2010»
13 years 3 months ago
Tunstall code, Khodak variations, and random walks
A variable-to-fixed length encoder partitions the source string into variable-length phrases that belong to a given and fixed dictionary. Tunstall, and independently Khodak, desig...
Michael Drmota, Yuriy A. Reznik, Wojciech Szpankow...
MCS
2004
Springer
14 years 1 months ago
A Comparison of Ensemble Creation Techniques
We experimentally evaluate bagging and six other randomization-based approaches to creating an ensemble of decision-tree classifiers. Bagging uses randomization to create multipl...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...
ICALP
2007
Springer
14 years 2 months ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...
ICPR
2010
IEEE
14 years 2 months ago
On-Line Random Naive Bayes for Tracking
—Randomized learning methods (i.e., Forests or Ferns) have shown excellent capabilities for various computer vision applications. However, it was shown that the tree structure in...
Martin Godec, Christian Leistner, Amir Saffari, Ho...
AI
2002
Springer
13 years 8 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo