Sciweavers

7006 search results - page 364 / 1402
» Approximation Algorithms
Sort
View
CGF
2010
157views more  CGF 2010»
15 years 1 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen
DASFAA
2003
IEEE
151views Database» more  DASFAA 2003»
15 years 9 months ago
Approximate String Matching in DNA Sequences
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu
ICDE
2012
IEEE
252views Database» more  ICDE 2012»
13 years 7 months ago
Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
Chong Sun, Jeffrey F. Naughton, Siddharth Barman
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
15 years 2 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 10 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein