Sciweavers

230 search results - page 18 / 46
» Quantum Search with Variable Times
Sort
View
STACS
2004
Springer
15 years 5 months ago
Algorithms for SAT Based on Search in Hamming Balls
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolper...
IDA
2003
Springer
15 years 5 months ago
Learning Dynamic Bayesian Networks from Multivariate Time Series with Changing Dependencies
Abstract. Many examples exist of multivariate time series where dependencies between variables change over time. If these changing dependencies are not taken into account, any mode...
Allan Tucker, Xiaohui Liu
113
Voted
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
15 years 6 months ago
Finding Predictive Runs with LAPS
We present an extension to the Lasso [9] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...
Suhrid Balakrishnan, David Madigan
NC
2006
132views Neural Networks» more  NC 2006»
15 years 10 days ago
Learning short multivariate time series models through evolutionary and sparse matrix computation
Multivariate Time Series (MTS) data are widely available in different fields including medicine, finance, bioinformatics, science and engineering. Modelling MTS data accurately is...
Stephen Swift, Joost N. Kok, Xiaohui Liu
AAAI
1996
15 years 1 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter