Sciweavers

876 search results - page 80 / 176
» New Results for the Martin Polynomial
Sort
View
MOC
2011
13 years 4 months ago
Analysis of HDG methods for Stokes flow
Abstract. In this paper, we analyze a hybridizable discontinuous Galerkin method for numerically solving the Stokes equations. The method uses polynomials of degree k for all the c...
Bernardo Cockburn, Jayadeep Gopalakrishnan, Ngoc C...
INFOCOM
2011
IEEE
13 years 1 months ago
Optimizing network-coded cooperative communications via joint session grouping and relay node selection
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...
WADS
2009
Springer
202views Algorithms» more  WADS 2009»
14 years 4 months ago
Minimal Locked Trees
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties...
Brad Ballinger, David Charlton, Erik D. Demaine, M...
ICCAD
2008
IEEE
105views Hardware» more  ICCAD 2008»
14 years 6 months ago
Parameterized transient thermal behavioral modeling for chip multiprocessors
In this paper, we propose a new architecture-level parameterized transient thermal behavioral modeling algorithm for emerging thermal related design and optimization problems for ...
Duo Li, Sheldon X.-D. Tan, Eduardo H. Pacheco, Mur...
EJC
2008
13 years 10 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias