3341 search results - page 177 / 669 » On Bounded Queries and Approximation |
168
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
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...
SSD
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Many new applications involving moving objects require the collection and querying of trajectory data, so efficient indexing methods are needed to support complex spatio...
SPIN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
WSC
2008
15 years 21 days ago
2008
We study a stochastic optimization problem that has its roots in financial portfolio design. The problem has a specified deterministic objective function and constraints on the co...
107
click to vote
ICA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Recently, the authors developed the Minimax Mutual Information algorithm for linear ICA of real-valued mixtures, which is based on a density estimate stemming from Jaynes...