Sciweavers

1554 search results - page 272 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
EMSOFT
2010
Springer
14 years 8 months ago
Power-aware temporal isolation with variable-bandwidth servers
Variable-bandwidth servers (VBS) control process execution speed by allocating variable CPU bandwidth to processes. VBS enables temporal isolation of EDF-scheduled processes in th...
Silviu S. Craciunas, Christoph M. Kirsch, Ana Soko...
111
Voted
KAIS
2011
129views more  KAIS 2011»
14 years 5 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
92
Voted
QEST
2007
IEEE
15 years 4 months ago
Automated Analysis of Simulation Traces - Separating Progress from Repetitive Behavior
Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In t...
Peter Kemper, Carsten Tepper
AAAI
2007
15 years 14 days ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
ICMLA
2007
14 years 11 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio