Sciweavers

249 search results - page 26 / 50
» Finding Patterns in Given Intervals
Sort
View
ICML
1994
IEEE
13 years 12 months ago
Efficient Algorithms for Minimizing Cross Validation Error
Model selection is important in many areas of supervised learning. Given a dataset and a set of models for predicting with that dataset, we must choose the model which is expected...
Andrew W. Moore, Mary S. Lee
CDC
2008
IEEE
149views Control Systems» more  CDC 2008»
13 years 10 months ago
Distributed computation under bit constraints
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...
Ola Ayaso, Devavrat Shah, Munther A. Dahleh
DEXA
2010
Springer
182views Database» more  DEXA 2010»
13 years 8 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
13 years 3 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
JMLR
2002
133views more  JMLR 2002»
13 years 8 months ago
Learning Precise Timing with LSTM Recurrent Networks
The temporal distance between events conveys information essential for numerous sequential tasks such as motor control and rhythm detection. While Hidden Markov Models tend to ign...
Felix A. Gers, Nicol N. Schraudolph, Jürgen S...