Sciweavers

1046 search results - page 97 / 210
» Approximation Algorithms for Domination Search
Sort
View
192
Voted
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
16 years 22 days ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
96
Voted
SIGIR
2009
ACM
15 years 7 months ago
Approximating true relevance distribution from a mixture model based on irrelevance data
Pseudo relevance feedback (PRF), which has been widely applied in IR, aims to derive a distribution from the top n pseudo relevant documents D. However, these documents are often ...
Peng Zhang, Yuexian Hou, Dawei Song

Lecture Notes
443views
16 years 10 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
96
Voted
ISCAS
2005
IEEE
133views Hardware» more  ISCAS 2005»
15 years 6 months ago
Multiobjective VLSI cell placement using distributed simulated evolution algorithm
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
Sadiq M. Sait, Ali Mustafa Zaidi, Mustafa I. Ali
124
Voted
ATAL
2007
Springer
15 years 6 months ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee