Sciweavers

29 search results - page 3 / 6
» Index coding via linear programming
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
12 years 9 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
ICASSP
2011
IEEE
12 years 6 months ago
Detection of upper airway narrowing via classification of LPC coefficients: Implications for obstructive sleep apnea diagnosis
The similarities between unvoiced speech sounds and turbulent breath sounds were used to detect change in sound characteristics caused by narrowing of the upper airway (UA), simil...
Hisham Alshaer, Martha Garcia, M. Hossein Radfar, ...
LCTRTS
2005
Springer
13 years 8 months ago
A dictionary construction technique for code compression systems with echo instructions
Dictionary compression mechanisms identify redundant sequences of instructions that occur in a program. The sequences are extracted and copied to a dictionary. Each sequence is th...
Philip Brisk, Jamie Macbeth, Ani Nahapetian, Majid...
ICPR
2008
IEEE
13 years 9 months ago
Medical image segmentation via min s-t cuts with sides constraints
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
Jiun-Hung Chen, Linda G. Shapiro
IPL
2010
114views more  IPL 2010»
13 years 1 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer