Sciweavers

4229 search results - page 248 / 846
» On the Optimality of Spiral Search
Sort
View
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
15 years 12 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
ICDM
2002
IEEE
191views Data Mining» more  ICDM 2002»
15 years 11 months ago
Iterative Clustering of High Dimensional Text Data Augmented by Local Search
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
Inderjit S. Dhillon, Yuqiang Guan, J. Kogan
SSDBM
2002
IEEE
100views Database» more  SSDBM 2002»
15 years 11 months ago
Similarity Searching for Multi-Attribute Sequences
We investigate the problem of searching similar multiattribute time sequences. Such sequences arise naturally in a number of medical, financial, video, weather forecast, and stoc...
Tamer Kahveci, Ambuj K. Singh, Aliekber Gürel
SARA
2009
Springer
15 years 11 months ago
Light Algorithms for Maintaining Max-RPC During Search
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
Julien Vion, Romuald Debruyne
COMPGEOM
1994
ACM
15 years 10 months ago
Competitive Searching in a Generalized Street
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
Amitava Datta, Christian Icking