Sciweavers

16093 search results - page 168 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
CIARP
2009
Springer
16 years 1 months ago
Optimizations and Performance of a Robotics Grasping Algorithm Described in Geometric Algebra
Abstract. The usage of Conformal Geometric Algebra leads to algorithms that can be formulated in a very clear and easy to grasp way. But it can also increase the performance of an ...
Florian Wörsdörfer, Florian Stock, Eduar...
SIES
2007
IEEE
16 years 25 days ago
Synchronization for an optimal real-time scheduling algorithm on multiprocessors
— We consider several object sharing synchronization mechanisms including lock-based, lock-free, and wait-free sharing for LNREF [1], an optimal real-time scheduling algorithm on...
Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
FOCS
2006
IEEE
16 years 18 days ago
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
László Lovász, Santosh Vempal...
SSPR
2004
Springer
15 years 12 months ago
Feature Subset Selection Using an Optimized Hill Climbing Algorithm for Handwritten Character Recognition
This paper presents an optimized Hill Climbing algorithm to select a subset of features for handwritten character recognition. The search is conducted taking into account a random ...
Carlos M. Nunes, Alceu de Souza Britto Jr., Celso ...
PR
1998
86views more  PR 1998»
15 years 6 months ago
Optimizing the cost matrix for approximate string matching using genetic algorithms
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
Marc Parizeau, Nadia Ghazzali, Jean-Françoi...