Sciweavers

8025 search results - page 278 / 1605
» Combinators Introduction: An Algorithm
Sort
View
WAOA
2004
Springer
112views Algorithms» more  WAOA 2004»
16 years 1 days ago
Online Bin Packing with Resource Augmentation
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
Leah Epstein, Rob van Stee
TWC
2008
158views more  TWC 2008»
15 years 6 months ago
Solving Box-Constrained Integer Least Squares Problems
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or prepro...
Xiao-Wen Chang, Qing Han
ICA
2007
Springer
16 years 26 days ago
Optimization on the Orthogonal Group for Independent Component Analysis
Abstract. This paper derives a new algorithm that performs independent component analysis (ICA) by optimizing the contrast function of the RADICAL algorithm. The core idea of the p...
Michel Journée, Pierre-Antoine Absil, Rodol...
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
16 years 7 days ago
Optimal Integer Alphabetic Trees in Linear Time
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
T. C. Hu, Lawrence L. Larmore, J. David Morgenthal...
FIMI
2003
104views Data Mining» more  FIMI 2003»
15 years 8 months ago
AIM: Another Itemset Miner
We present a new algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the efficiency of the mining task. We integrate...
Amos Fiat, Sagi Shporer