Sciweavers

887 search results - page 29 / 178
» A Time for Choosing
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Proportionate-type normalized least mean square algorithm with gain allocation motivated by minimization of mean-square-weight d
In previous work, a water-filling algorithm was proposed which sought to minimize the mean square error (MSE) at any given time by optimally choosing the gains (i.e. step-sizes) ...
Kevin T. Wagner, Milos Doroslovacki
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
13 years 11 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
PVLDB
2008
138views more  PVLDB 2008»
13 years 7 months ago
A skip-list approach for efficiently processing forecasting queries
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support pred...
Tingjian Ge, Stanley B. Zdonik
JCO
1998
102views more  JCO 1998»
13 years 7 months ago
Facility Location with Dynamic Distance Functions
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...
Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram...
IJSNET
2008
125views more  IJSNET 2008»
13 years 7 months ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong