Sciweavers

62 search results - page 7 / 13
» Approximating general metric distances between a pattern and...
Sort
View
JDA
2008
87views more  JDA 2008»
13 years 7 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...
SI3D
1999
ACM
13 years 12 months ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
14 years 1 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
APVIS
2008
13 years 9 months ago
Illustrative Streamline Placement and Visualization
by the abstracting, focusing and explanatory qualities of diagram drawing in art, in this paper we propose a novel seeding strategy to generate representative and illustrative str...
Liya Li, Hsien-Hsi Hsieh, Han-Wei Shen
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
13 years 8 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...