Depth Lower Bounds against Circuits with Sparse Orientation.
Sajin KorothJayalal SarmaPublished in: COCOON (2014)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- np hard
- depth map
- branch and bound
- compressive sensing
- sparse data
- position and orientation
- optimal solution
- worst case
- quadratic assignment problem
- logic circuits
- digital circuits
- lower and upper bounds
- depth information
- sparse coding
- high dimensional
- circuit design
- high speed
- analog circuits
- multiscale