Sciweavers

1046 search results - page 84 / 210
» Approximation Algorithms for Domination Search
Sort
View
132
Voted
SSDBM
1999
IEEE
124views Database» more  SSDBM 1999»
15 years 4 months ago
An Indexing Scheme for Fast Similarity Search in Large Time Series Databases
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
Eamonn J. Keogh, Michael J. Pazzani
112
Voted
WWW
2009
ACM
16 years 1 months ago
Exploiting web search to generate synonyms for entities
Tasks recognizing named entities such as products, people names, or locations from documents have recently received significant attention in the literature. Many solutions to thes...
Surajit Chaudhuri, Venkatesh Ganti, Dong Xin
GECCO
2010
Springer
248views Optimization» more  GECCO 2010»
15 years 4 months ago
Integrating decision space diversity into hypervolume-based multiobjective search
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...
Tamara Ulrich, Johannes Bader, Eckart Zitzler
95
Voted
ICML
2005
IEEE
16 years 1 months ago
A practical generalization of Fourier-based learning
This paper presents a search algorithm for finding functions that are highly correlated with an arbitrary set of data. The functions found by the search can be used to approximate...
Adam Drake, Dan Ventura
121
Voted
AI
2002
Springer
15 years 12 days ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm