ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
This paper presents a simple randomised algorithm for recovering high-dimensional sparse functions, i.e. functions f : [0, 1]d → R which depend effectively only on k out of d va...
JSAC
2010
13 years 9 months ago
2010
Abstract— Service placement is a key problem in communication networks as it determines how efficiently the user service demands are supported. This problem has been traditional...
AUTOMATICA
2004
13 years 10 months ago
2004
From an analog system K, digital systems Kd and Kbt are often obtained via the step-invariant and bilinear transformations, respectively. For the case when K is stable, it is show...
ENTCS
2007
13 years 10 months ago
2007
When developing systems based on COTS, components need to be adapted in most of the occasions to work under certain conditions which were not initially predicted by their develope...
ALGORITHMICA
2007
13 years 11 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
DEXA
1998
Springer
14 years 3 months ago
1998
Springer
Intelligent agents and active databases have a number of common characteristics, the most important of which is that they both execute actions by firing rules upon events occurring...
IEEEARES
2010
IEEE
14 years 3 months ago
2010
IEEE
Many software security vulnerabilities only reveal themselves under certain conditions, i.e., particular configurations of the software together with its particular runtime environ...
VMCAI
2004
Springer
14 years 4 months ago
2004
Springer
This paper shows how to achieve, under certain conditions, abstract-interpretation ms that enjoy the best possible precision for a given abstraction. The key idea is a simple proce...