Sciweavers

79 search results - page 4 / 16
» On the Relaxation of n-detect Test Sets
Sort
View
ICML
2008
IEEE
15 years 10 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
LREC
2008
174views Education» more  LREC 2008»
14 years 11 months ago
Automatic Phoneme Segmentation with Relaxed Textual Constraints
Speech synthesis by unit selection requires the segmentation of a large single speaker high quality recording. Automatic speech recognition techniques, e.g. Hidden Markov Models (...
Pierre Lanchantin, Andrew C. Morris, Xavier Rodet,...
TCOM
2010
197views more  TCOM 2010»
14 years 7 months ago
Power control for cooperative dynamic spectrum access networks with diverse QoS constraints
Dynamic spectrum access (DSA) is an integral part of cognitive radio technology aiming at efficient management of the available power and bandwidth resources. The present paper d...
Nikolaos Gatsis, Antonio G. Marqués, Georgi...
SIAMSC
2011
148views more  SIAMSC 2011»
14 years 4 months ago
Bootstrap AMG
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...
Achi Brandt, James J. Brannick, K. Kahl, Irene Liv...
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
15 years 6 months ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris