Sciweavers

1439 search results - page 111 / 288
» Fast approximation of centrality
Sort
View
SMA
2008
ACM
162views Solid Modeling» more  SMA 2008»
14 years 10 months ago
Fast and robust bootstrap
The Least Trimmed Squares (LTS) estimator is a frequently used robust estimator of regression. When it comes to inference for the parameters of the regression model, the asymptoti...
Matias Salibian-Barrera, Stefan Van Aelst, Gert Wi...
TON
2008
125views more  TON 2008»
14 years 10 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
MP
2002
101views more  MP 2002»
14 years 9 months ago
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
The asymptotic convergence of parameterized variants of Newton's method for the solution of nonlinear systems of equations is considered. The original system is perturbed by a...
Nicholas I. M. Gould, Dominique Orban, Annick Sart...
RAS
2007
102views more  RAS 2007»
14 years 9 months ago
Fast and accurate SLAM with Rao-Blackwellized particle filters
Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter in which each ...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...
MFCS
2010
Springer
14 years 8 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...