Sciweavers

84
Voted
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 11 days ago
Computing Integer Powers in Floating-Point Arithmetic
We introduce two algorithms for accurately evaluating powers to a positive integer in floating-point arithmetic, assuming a fused multiply-add (fma) instruction is available. We ...
Peter Kornerup, Vincent Lefèvre, Jean-Miche...
60
Voted
INFORMATICALT
2006
65views more  INFORMATICALT 2006»
15 years 11 days ago
Iterative Estimation Algorithm of Autoregressive Parameters
This paper presents an iterative autoregressive system parameter estimation algorithm in the presence of white observation noise. The algorithm is based on the parameter estimation...
Kazys Kazlauskas, Jaunius Kazlauskas
91
Voted
JCP
2008
133views more  JCP 2008»
15 years 11 days ago
DDSC : A Density Differentiated Spatial Clustering Technique
Finding clusters with widely differing sizes, shapes and densities in presence of noise and outliers is a challenging job. The DBSCAN is a versatile clustering algorithm that can f...
Bhogeswar Borah, Dhruba K. Bhattacharyya
102
Voted
JCO
2008
66views more  JCO 2008»
15 years 11 days ago
The hierarchical model for load balancing on two machines
Following previous work, we consider the hierarchical load balancing model on two machines of possibly different speeds. We first focus on maximizing the minimum machine load and ...
Orion Chassid, Leah Epstein
97
Voted
CORR
2007
Springer
84views Education» more  CORR 2007»
15 years 11 days ago
Undirected Graphs of Entanglement Two
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 11 days ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
Pierre-Francois Marteau, Gildas Ménier
94
Voted
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 11 days ago
Target assignment for robotic networks: asymptotic performance under limited communication
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
Stephen L. Smith, Francesco Bullo
82
Voted
JC
2008
77views more  JC 2008»
15 years 11 days ago
A numerical algorithm for zero counting, I: Complexity and accuracy
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
Felipe Cucker, Teresa Krick, Gregorio Malajovich, ...
CORR
2007
Springer
107views Education» more  CORR 2007»
15 years 11 days ago
Asynchronous Distributed Searchlight Scheduling
Abstract— This paper develops and compares two asynchronous distributed scheduling algorithms for multiple controlled searchlights in nonconvex polygonal environments. A searchli...
Karl J. Obermeyer, Anurag Ganguli, Francesco Bullo
69
Voted
IJON
2006
77views more  IJON 2006»
15 years 11 days ago
Robust extraction of specific signals with temporal structure
There is a trend to develop blind or semi-blind source extraction algorithms based on second-order statistics, due to its low computation load and fast processing speed. An import...
Zhi-Lin Zhang, Zhang Yi