Sciweavers

137 search results - page 12 / 28
» Deformation Techniques for Efficient Polynomial Equation Sol...
Sort
View
NA
2007
147views more  NA 2007»
13 years 7 months ago
An adaptive spectral least-squares scheme for the Burgers equation
A least-squares spectral collocation method for the one-dimensional inviscid Burgers equation is proposed. This model problem shows the stability and high accuracy of these scheme...
Wilhelm Heinrichs
VIIP
2001
13 years 9 months ago
View-dependent Deformation for Virtual Human Modeling from Silhouettes
The primary objective of this research work is to develop an efficient and intuitive deformation technique for virtual human modeling by silhouettes input. With our method, the re...
Charlie C. L. Wang, Yu Wang 0010, Matthew Ming-Fai...
PODS
2006
ACM
137views Database» more  PODS 2006»
14 years 7 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
EUROCRYPT
2009
Springer
14 years 8 months ago
Cube Attacks on Tweakable Black Box Polynomials
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
Itai Dinur, Adi Shamir
CVPR
2006
IEEE
13 years 11 months ago
Accurate Tracking of Monotonically Advancing Fronts
A wide range of computer vision applications such as distance field computation, shape from shading, and shape representation require an accurate solution of a particular Hamilton...
M. Sabry Hassouna, Aly A. Farag