Sciweavers

2292 search results - page 130 / 459
» Hierarchical approximation and localization
Sort
View
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
15 years 3 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
ICRA
2006
IEEE
119views Robotics» more  ICRA 2006»
15 years 10 months ago
Polygonal Approximation of Laser Range Data based on Perceptual Grouping and EM
— Our goal is polygonal approximation of laser range data points obtained by a mobile robot. The proposed approach provides a precise estimation of the number of model components...
Longin Jan Latecki, Rolf Lakämper
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
15 years 10 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
CSDA
2010
132views more  CSDA 2010»
15 years 4 months ago
Approximate low-rank factorization with structured factors
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
Ivan Markovsky, Mahesan Niranjan
151
Voted
IM
2007
15 years 4 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito