Sciweavers

2157 search results - page 157 / 432
» Binary ant algorithm
Sort
View
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 6 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
ALT
2005
Springer
16 years 3 months ago
Mixture of Vector Experts
Abstract. We describe and analyze an algorithm for predicting a sequence of n-dimensional binary vectors based on a set of experts making vector predictions in [0, 1]n . We measure...
Matthew Henderson, John Shawe-Taylor, Janez Zerovn...
177
Voted
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
16 years 16 days ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
LCN
2005
IEEE
15 years 11 months ago
Probabilistic Coverage in Wireless Sensor Networks
— The sensing capabilities of networked sensors are affected by environmental factors in real deployment and it is imperative to have practical considerations at the design stage...
Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha
138
Voted
ISAAC
2001
Springer
87views Algorithms» more  ISAAC 2001»
15 years 10 months ago
On Removing the Pushdown Stack in Reachability Constructions
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton...
Oscar H. Ibarra, Zhe Dang