## Search

Now showing items 1-5 of 5

#### Parameterized Complexity of k-SPARSE problems

(2016)

Given an m-dimensional dictionary of size n and a number k, one might wish to represent an incoming datum using at most k non-zero weights. If k is given as a parameter, this problem is as known as the sparsity constraint ...

#### Parameterized Complexity of k-SPARSE problems

(2016)

Given an m-dimensional dictionary of size n and a number k, one might wish to represent an incoming datum using at most k non-zero weights. If k is given as a parameter, this problem is as known as the sparsity constraint ...

#### Parameterized Complexity of k-SPARSE problems

(2016)

Given an m-dimensional dictionary of size n and a number k, one might wish to represent an incoming datum using at most k non-zero weights. If k is given as a parameter, this problem is as known as the sparsity constraint ...

#### Auditory augmented space

(2016)

Seeking to question the over-reliance of designing space based on the arrangement of visual elements, this study intends to emphasize “sound” as the primary medium for spatial creation. While space is inherently mute without ...

#### Auditory augmented space

(2016)

Seeking to question the over-reliance of designing space based on the arrangement of visual elements, this study intends to emphasize “sound” as the primary medium for spatial creation. While space is inherently mute without ...