Sciweavers

1429 search results - page 217 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
NIPS
2008
13 years 9 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
ERSA
2004
106views Hardware» more  ERSA 2004»
13 years 9 months ago
QOS Aware HW/SW Partitioning on Run-time Reconfigurable Multimedia Platforms
Advanced multimedia applications (e.g. based on MPEG-4) will consist of multiple scalable multimedia objects. This scalability enables the application to adapt to different proces...
Nam Pham Ngoc, Gauthier Lafruit, Jean-Yves Mignole...
WCNC
2010
IEEE
13 years 6 months ago
On MIMO Cognitive Radios with Antenna Selection
—With the ever increasing interest in multiple-input multiple-output (MIMO) cognitive radio (CR) systems, reducing the costs associated with RF-chains at the radio front end beco...
Muhammad Fainan Hanif, Peter J. Smith
SIAMNUM
2011
124views more  SIAMNUM 2011»
13 years 2 months ago
Discrete Compactness for the p-Version of Discrete Differential Forms
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...
Daniele Boffi, Martin Costabel, Monique Dauge, Les...
JSS
2010
104views more  JSS 2010»
13 years 2 months ago
Using hybrid algorithm for Pareto efficient multi-objective test suite minimisation
Test suite minimisation techniques seek to reduce the effort required for regression testing by selecting a subset of test suites. In previous work, the problem has been considere...
Shin Yoo, Mark Harman