Sciweavers

6943 search results - page 1138 / 1389
» Representations for evolutionary algorithms
Sort
View
CGF
2010
120views more  CGF 2010»
15 years 6 months ago
Polygonal mesh watermarking using Laplacian coordinates
We propose a watermarking algorithm for polygonal meshes based on the modification of the Laplacian coordinates. More specifically, we first compute the Laplacian coordinates (x,y...
Ying Yang, Ioannis P. Ivrissimtzis
CGF
2008
135views more  CGF 2008»
15 years 6 months ago
Streaming Surface Reconstruction Using Wavelets
We present a streaming method for reconstructing surfaces from large data sets generated by a laser range scanner using wavelets. Wavelets provide a localized, multiresolution rep...
Josiah Manson, G. Petrova, Scott Schaefer
CORR
2010
Springer
225views Education» more  CORR 2010»
15 years 6 months ago
Sensing Matrix Optimization for Block-Sparse Decoding
Recent work has demonstrated that using a carefully designed sensing matrix rather than a random one, can improve the performance of compressed sensing. In particular, a welldesign...
Kevin Rosenblum, Lihi Zelnik-Manor, Yonina C. Elda...
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 6 months ago
Optimally Sparse Frames
Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. Howe...
Peter G. Casazza, Andreas Heinecke, Felix Krahmer,...
ENTCS
2008
85views more  ENTCS 2008»
15 years 6 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset
« Prev « First page 1138 / 1389 Last » Next »