Sciweavers

2421 search results - page 139 / 485
» Approximate Flow-Aware Networking
Sort
View
ML
1998
ACM
153views Machine Learning» more  ML 1998»
15 years 2 months ago
Bayesian Landmark Learning for Mobile Robot Localization
To operate successfully in indoor environments, mobile robots must be able to localize themselves. Most current localization algorithms lack flexibility, autonomy, and often optim...
Sebastian Thrun
NN
2002
Springer
224views Neural Networks» more  NN 2002»
15 years 2 months ago
Optimal design of regularization term and regularization parameter by subspace information criterion
The problem of designing the regularization term and regularization parameter for linear regression models is discussed. Previously, we derived an approximation to the generalizat...
Masashi Sugiyama, Hidemitsu Ogawa
NCA
2007
IEEE
15 years 2 months ago
A computational strategy exploiting genetic algorithms to recover color surface reflectance functions
—Information about the spectral reflectance of a color surface is useful in many applications. Assuming that reflectance functions can be adequately approximated by a linear comb...
Raimondo Schettini, Silvia Zuffi
138
Voted
COR
2008
131views more  COR 2008»
15 years 1 months ago
Queueing analysis of a server node in transaction processing middleware systems
Quantitative performance modeling of complex information systems is of immense importance for designing enterprise e-business infrastructures and applications. In this paper, we p...
Wei Xiong, Tayfur Altiok
CDC
2010
IEEE
100views Control Systems» more  CDC 2010»
14 years 10 months ago
A resistance-based approach to consensus algorithm performance analysis
Abstract-We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. ...
Federica Garin, Enrico Lovisari, Sandro Zampieri