Sciweavers

1064 search results - page 160 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
CORR
2011
Springer
145views Education» more  CORR 2011»
14 years 11 months ago
MDS Array Codes with Optimal Rebuilding
—MDS array codes are widely used in storage systems to protect data against erasures. We address the rebuilding ratio problem, namely, in the case of erasures, what is the the fr...
Itzhak Tamo, Zhiying Wang, Jehoshua Bruck
DAM
2006
132views more  DAM 2006»
15 years 4 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
WWW
2009
ACM
16 years 4 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
IWANN
2005
Springer
15 years 9 months ago
Input Selection for Long-Term Prediction of Time Series
Prediction of time series is an important problem in many areas of science and engineering. Extending the horizon of predictions further to the future is the challenging and diffic...
Jarkko Tikka, Jaakko Hollmén, Amaury Lendas...
CIKM
1998
Springer
15 years 8 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki