5169 search results - page 58 / 1034 » Locality approximation using time |
104
Voted
AUTOMOTIVEUI
2009
ACM
15 years 8 months ago
2009
ACM
We present an experimental study on the effectiveness of five modality variants (speech, text-only, icon-only, two combinations of text and icons) for presenting local danger wa...
104
click to vote
FS
2010
15 years 27 days ago
2010
Abstract A time-dependent double-barrier option is a derivative security that delivers the terminal value φ(ST ) at expiry T if neither of the continuous time-dependent barriers b...
127
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
104
click to vote
TIP
1998
15 years 2 months ago
1998
—The distance transform has found many applications in image analysis. Chamfer distance transforms are a class of discrete algorithms that offer a good approximation to the desir...
123
click to vote
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...