4047 search results - page 271 / 810 » The Discrete Basis Problem |
145
Voted
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
167
click to vote
DIALM
2005
ACM
15 years 6 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
106
click to vote
ICIP
2007
IEEE
16 years 6 months ago
2007
IEEE
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
126
click to vote
IPSN
2007
Springer
15 years 10 months ago
2007
Springer
This paper considers the problem of blindly calibrating sensor response using routine sensor network measurements. We show that as long as the sensors slightly oversample the sign...
147
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper presents a multi-scale point and line based representation of two-dimensional range scan data. The techniques are based on a multi-scale Hough transform and a tree r...