5387 search results - page 757 / 1078 » Generating generic functions |
164
Voted
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
148
click to vote
CSE
2009
IEEE
16 years 1 months ago
2009
IEEE
Conventional cryptography uses encryption key, which are long bit strings and are very hard to memorize such a long random numbers. Also it can be easily attacked by using the brut...
166
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
163
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
We propose a new approach to adaptive system identification when the system model is sparse. The approach applies the ℓ1 relaxation, common in compressive sensing, to improve t...
285
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— For multiple-input multiple-output (MIMO) systems, the optimum maximum likelihood (ML) detection requires tremendous complexity as the number of antennas or modulation ...