8825 search results - page 217 / 1765 » All for one or one for all |
FIMI
2003
15 years 3 months ago
2003
We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The...
69
Voted
SODA
2004
ACM
15 years 3 months ago
2004
ACM
How many ways can a rectangle be partitioned into smaller ones? We study two variants of this problem: when the partitions are constrained to lie on n given points (no two of whic...
WSC
2001
15 years 3 months ago
2001
At one time or another we have all faced the doubters who wonder why they need to use simulation. We have wowed our potential clients with animation, left them in awe at our grasp...
115
click to vote
NIPS
2000
15 years 2 months ago
2000
An on-line recursive algorithm for training support vector machines, one vector at a time, is presented. Adiabatic increments retain the KuhnTucker conditions on all previously se...
121
click to vote
WSC
1998
15 years 2 months ago
1998
In this paper we compare the average performance of one class of low-discrepancy quasi-Monte Carlo sequences for global optimization. Weiner measure is assumed as the probability ...