Sciweavers

2078 search results - page 241 / 416
» MetaCores: Design and Optimization Techniques
Sort
View
IPPS
2002
IEEE
15 years 3 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
VLSID
2000
IEEE
94views VLSI» more  VLSID 2000»
15 years 2 months ago
A Genetic Algorithm for the Synthesis of Structured Data Paths
The technique presented here achieves simultaneous optimization of schedule time and data path component cost within a structured data path architecture, using a genetic algorithm...
Chittaranjan A. Mandal, R. M. Zimmer
CGF
2002
95views more  CGF 2002»
14 years 10 months ago
Intrinsic Parameterizations of Surface Meshes
Parameterization of discrete surfaces is a fundamental and widely-used operation in graphics, required, for instance, for texture mapping or remeshing. As 3D data becomes more and...
Mathieu Desbrun, Mark Meyer, Pierre Alliez
WWW
2005
ACM
15 years 10 months ago
Hierarchical substring caching for efficient content distribution to low-bandwidth clients
While overall bandwidth in the internet has grown rapidly over the last few years, and an increasing number of clients enjoy broadband connectivity, many others still access the i...
Utku Irmak, Torsten Suel
ICC
2008
IEEE
116views Communications» more  ICC 2008»
15 years 4 months ago
Nonlinear Turbo Codes for Higher-Order Modulations
— In 1982 Ungerboeck presented a set-partitioning design technique for trellis coded modulation (TCM). Although this technique directly assigns constellation points to the branch...
Miguel Griot, Andres I. Vila Casado, Richard D. We...