Sciweavers

1604 search results - page 90 / 321
» Approximation algorithms for developable surfaces
Sort
View
SMI
2006
IEEE
135views Image Analysis» more  SMI 2006»
15 years 7 months ago
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
Bruno Lévy
ATAL
2010
Springer
14 years 8 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 5 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
CPM
1998
Springer
132views Combinatorics» more  CPM 1998»
15 years 5 months ago
Reporting Exact and Approximate Regular Expression Matches
While much work has been done on determining if a document or a line of a document contains an exact or approximate match to a regular expression, less e ort has been expended in ...
Eugene W. Myers, Paulo Oliva, Katia S. Guimar&atil...
ASPDAC
2010
ACM
119views Hardware» more  ASPDAC 2010»
14 years 11 months ago
VISA: versatile impulse structure approximation for time-domain linear macromodeling
Abstract-- We develop a rational function macromodeling algorithm named VISA (Versatile Impulse Structure Approximation) for macromodeling of system responses with (discrete) time-...
Chi-Un Lei, Ngai Wong