Sciweavers

3096 search results - page 82 / 620
» The Generalized FITC Approximation
Sort
View
MP
1998
109views more  MP 1998»
13 years 8 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
TNN
1998
111views more  TNN 1998»
13 years 8 months ago
Asymptotic distributions associated to Oja's learning equation for neural networks
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
Jean Pierre Delmas, Jean-Francois Cardos
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 7 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu
GIS
2010
ACM
13 years 7 months ago
Supporting location-based approximate-keyword queries
Many Web sites support keyword search on their spatial data, such as business listings and photos. In these systems, inconsistencies and errors can exist in both queries and the d...
Sattam Alsubaiee, Alexander Behm, Chen Li
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
13 years 7 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou