Sciweavers

1421 search results - page 78 / 285
» Algorithms for subsequence combinatorics
Sort
View
SIAMMAX
2010
123views more  SIAMMAX 2010»
14 years 10 months ago
Joint Spectral Characteristics of Matrices: A Conic Programming Approach
We propose a new approach to estimate the joint spectral radius and the joint spectral subradius of an arbitrary set of matrices. We first restrict our attention to matrices that ...
Vladimir Protasov, Raphaël M. Jungers, Vincen...
COMPGEOM
2006
ACM
15 years 10 months ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
15 years 7 months ago
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
Michal Meyerovitch
CHES
2005
Springer
83views Cryptology» more  CHES 2005»
15 years 9 months ago
Fast Truncated Multiplication for Cryptographic Applications
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
Laszlo Hars
111
Voted
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 9 months ago
Multi-chromosomal genetic programming
This paper introduces an evolutionary algorithm which uses multiple chromosomes to evolve solutions to a symbolic regression problem. Inspiration for this algorithm is provided by...
Rachel Cavill, Stephen L. Smith, Andrew M. Tyrrell