Sciweavers

2600 search results - page 408 / 520
» Clustering with or without the Approximation
Sort
View
TSP
2008
69views more  TSP 2008»
13 years 9 months ago
A Frame Construction and a Universal Distortion Bound for Sparse Representations
Abstract-- We consider approximations of signals by the elements of a frame in a complex vector space of dimension N and formulate both the noiseless and the noisy sparse represent...
Mehmet Akçakaya, Vahid Tarokh
TSP
2008
140views more  TSP 2008»
13 years 9 months ago
On the Dual-Tree Complex Wavelet Packet and M-Band Transforms
The two-band discrete wavelet transform (DWT) provides an octave-band analysis in the frequency domain, but this might not be "optimal" for a given signal. The discrete w...
I. Bayram, Ivan W. Selesnick
CAD
2004
Springer
13 years 9 months ago
Choosing consistent constraints for beautification of reverse engineered geometric models
Boundary representation models reconstructed from 3D range data suffer from various inaccuracies caused by noise in the data and the model building software. Such models can be im...
Frank C. Langbein, A. David Marshall, Ralph R. Mar...
CCE
2004
13 years 9 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff
CN
2002
88views more  CN 2002»
13 years 9 months ago
Rate allocation and buffer management for differentiated services
A novel algorithm for buffer management and rate allocation is presented for providing loss and delay differentiation for traffic classes at a network router. The algorithm, calle...
Jörg Liebeherr, Nicolas Christin