Sciweavers

1632 search results - page 73 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
LION
2007
Springer
198views Optimization» more  LION 2007»
15 years 9 months ago
Multiobjective Landscape Analysis and the Generalized Assignment Problem
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
Deon Garrett, Dipankar Dasgupta
160
Voted
SIGIR
1999
ACM
15 years 7 months ago
Relevance Feedback Retrieval of Time Series Data
There has been much recent interest in retrieval of time series data. Earlier work has used a fixed similarity metric (e.g., Euclidean distance) to determine the similarity betwee...
Eamonn J. Keogh, Michael J. Pazzani
SPIRE
1998
Springer
15 years 7 months ago
Fast Approximate String Matching in a Dictionary
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
Ricardo A. Baeza-Yates, Gonzalo Navarro
162
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
FSTTCS
2009
Springer
15 years 10 months ago
Algorithms for Message Ferrying on Mobile ad hoc Networks
ABSTRACT. Message Ferrying is a mobility assisted technique for working around the disconnectedness and sparsity of Mobile ad hoc networks. One of the important questions which ari...
Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das...