2376 search results - page 12 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
IPL
2000
13 years 7 months ago
2000
Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless a...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Sequential pattern mining has raised great interest in data mining research field in recent years. However, to our best knowledge, no existing work studies the problem of frequent...
ICCV
2009
IEEE
15 years 15 days ago
2009
IEEE
We present a novel variant of the RANSAC algorithm
that is much more efficient, in particular when dealing with
problems with low inlier ratios. Our algorithm assumes
that there...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
PVLDB
2010
13 years 2 months ago
2010
Skyline queries have gained considerable attention for multicriteria analysis of large-scale datasets. However, the skyline queries are known to return too many results for highdi...