Sciweavers

2517 search results - page 107 / 504
» Specifying Weak Sets
Sort
View
JC
2010
117views more  JC 2010»
15 years 7 days ago
Tractability through increasing smoothness
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithm...
Anargyros Papageorgiou, Henryk Wozniakowski
ICASSP
2011
IEEE
14 years 9 months ago
The value of redundant measurement in compressed sensing
The aim of compressed sensing is to recover attributes of sparse signals using very few measurements. Given an overall bit budget for quantization, this paper demonstrates that th...
Victoria Kostina, Marco F. Duarte, Sina Jafarpour,...
PLDI
2003
ACM
15 years 10 months ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...
DALT
2003
Springer
15 years 10 months ago
Logic-Based Electronic Institutions
We propose a logic-based rendition of electronic institutions – these are means to specify open agent organisations. We employ a simple notation based on first-order logic and s...
Wamberto Weber Vasconcelos
FASE
2000
Springer
15 years 9 months ago
Formal System Development with KIV
state-based approach KIV uses abstract state machines (ASMs, [5]) over algebraically specified data types. The semantics of an ASM is the set of
Michael Balser, Wolfgang Reif, Gerhard Schellhorn,...