Sciweavers

2542 search results - page 226 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
109
Voted
JSC
2008
162views more  JSC 2008»
15 years 19 days ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...
103
Voted
SAC
2010
ACM
15 years 7 months ago
A simple role mining algorithm
Complex organizations need to establish access control policies in order to manage access to restricted resources. Role Based Access Control paradigm has been introduced in ’90 ...
Carlo Blundo, Stelvio Cimato
94
Voted
HYBRID
2009
Springer
15 years 7 months ago
Decompositional Construction of Lyapunov Functions for Hybrid Systems
In this paper, we present an automatable decompositional method for the computation of Lyapunov functions for hybrid systems with complex discrete state spaces. We use graph-based ...
Jens Oehlerking, Oliver E. Theel
102
Voted
ICNC
2009
Springer
15 years 7 months ago
An Improved Greedy Genetic Algorithm for Solving Travelling Salesman Problem
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
Zhenchao Wang, Haibin Duan, Xiangyin Zhang
95
Voted
IROS
2007
IEEE
159views Robotics» more  IROS 2007»
15 years 7 months ago
Approximate covariance estimation in graphical approaches to SLAM
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...
Gian Diego Tipaldi, Giorgio Grisetti, Wolfram Burg...