Sciweavers

2957 search results - page 587 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
EMSOFT
2010
Springer
13 years 5 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...
ICCAD
2009
IEEE
136views Hardware» more  ICCAD 2009»
13 years 5 months ago
A hierarchical floating random walk algorithm for fabric-aware 3D capacitance extraction
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...
Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Dani...
CMA
2010
134views more  CMA 2010»
13 years 4 months ago
Particle tracking for fractional diffusion with two time scales
Abstract. Previous work [51] showed how to solve time-fractional diffusion equations by particle tracking. This paper extends the method to the case where the order of the fraction...
Mark M. Meerschaert, Yong Zhang, Boris Baeumer
JMLR
2011
157views more  JMLR 2011»
13 years 2 months ago
Variable Sparsity Kernel Learning
This paper1 presents novel algorithms and applications for a particular class of mixed-norm regularization based Multiple Kernel Learning (MKL) formulations. The formulations assu...
Jonathan Aflalo, Aharon Ben-Tal, Chiranjib Bhattac...
KAIS
2011
129views more  KAIS 2011»
13 years 2 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