Sciweavers

15777 search results - page 2607 / 3156
» The Reformulation-Optimization Software Engine
Sort
View
SIAMCOMP
2011
14 years 9 months ago
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
SIAMCOMP
2011
14 years 9 months ago
An Expansion Tester for Bounded Degree Graphs
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
Satyen Kale, C. Seshadhri
CIKM
2011
Springer
14 years 7 months ago
PDFMeat: managing publications on the semantic desktop
Researchers maintain bibliographies and extensive sets of PDF files of scholarly publications on their desktop. The lack of proper metadata of downloaded PDFs makes this task a t...
David Aumüller, Erhard Rahm
DAC
2003
ACM
16 years 8 months ago
Automatic trace analysis for logic of constraints
Verification of system designs continues to be a major challenge today. Simulation remains the primary tool for making sure that implementations perform as they should. We present...
Xi Chen, Harry Hsieh, Felice Balarin, Yosinori Wat...
WWW
2009
ACM
16 years 7 months ago
MASTH proxy: an extensible platform for web overload control
Many overload control mechanisms for Web based applications aim to prevent overload by setting limits on factors such as admitted load, number of server threads, buffer size. For ...
Vipul Mathur, Sanket Dhopeshwarkar, Varsha Apte
« Prev « First page 2607 / 3156 Last » Next »