Sciweavers

3874 search results - page 229 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
16 years 4 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
187
Voted
COCOON
2010
Springer
15 years 2 months ago
On Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
Xin Chen
WSC
2004
15 years 5 months ago
Approximate Time-Parallel Cache Simulation
In time-parallel simulation, the simulation time axis is decomposed into a number of slices which are assigned to parallel processes for concurrent simulation. Although a promisin...
Tobias Kiesling
PG
2007
IEEE
15 years 10 months ago
Developable Strip Approximation of Parametric Surfaces with Global Error Bounds
Developable surfaces have many desired properties in manufacturing process. Since most existing CAD systems utilize parametric surfaces as the design primitive, there is a great d...
Yong-Jin Liu, Yu-Kun Lai, Shi-Min Hu
ASPDAC
2010
ACM
119views Hardware» more  ASPDAC 2010»
15 years 2 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