Sciweavers

3221 search results - page 148 / 645
» Termination of Linear Programs
Sort
View
TIT
2011
116views more  TIT 2011»
15 years 1 months ago
Convex Programming Upper Bounds on the Capacity of 2-D Constraints
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
Ido Tal, Ron M. Roth
POPL
2007
ACM
16 years 6 months ago
Semantics of static pointcuts in aspectJ
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
Pavel Avgustinov, Elnar Hajiyev, Neil Ongkingco, O...
LPAR
2005
Springer
15 years 11 months ago
Matching with Regular Constraints
We describe a sound, terminating, and complete matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. C...
Temur Kutsia, Mircea Marin
CORR
2007
Springer
100views Education» more  CORR 2007»
15 years 6 months ago
Distributed Transmit Diversity in Relay Networks
Abstract— We analyze fading relay networks, where a singleantenna source-destination terminal pair communicates through a set of half-duplex single-antenna relays using a two-hop...
Cemal Akçaba, Patrick Kuppinger, Helmut B&o...
POPL
2009
ACM
16 years 6 months ago
A combination framework for tracking partition sizes
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv