Sciweavers

4451 search results - page 431 / 891
» On Random Ordering Constraints
Sort
View
TIT
2008
103views more  TIT 2008»
15 years 6 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
JC
2007
94views more  JC 2007»
15 years 6 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
TSP
2008
113views more  TSP 2008»
15 years 6 months ago
Covariance Matrix Estimation With Heterogeneous Samples
We consider the problem of estimating the covariance matrix of an observation vector, using heterogeneous training samples, i.e., samples whose covariance matrices are not exactly ...
Olivier Besson, Stéphanie Bidon, Jean-Yves ...
NN
2000
Springer
165views Neural Networks» more  NN 2000»
15 years 6 months ago
Construction of confidence intervals for neural networks based on least squares estimation
We present the theoretical results about the construction of confidence intervals for a nonlinear regression based on least squares estimation and using the linear Taylor expansio...
Isabelle Rivals, Léon Personnaz
SIGMETRICS
2002
ACM
114views Hardware» more  SIGMETRICS 2002»
15 years 6 months ago
Search and replication in unstructured peer-to-peer networks
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenke...