Sciweavers

6740 search results - page 1042 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
CORR
2010
Springer
200views Education» more  CORR 2010»
15 years 6 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
CPHYSICS
2006
119views more  CPHYSICS 2006»
15 years 6 months ago
GDF: A tool for function estimation through grammatical evolution
This article introduces a tool for data fitting that is based on genetic programming and especially on the grammatical evolution technique. The user needs to input a series of poi...
Ioannis G. Tsoulos, Dimitris Gavrilis, Evangelos D...
CPHYSICS
2006
182views more  CPHYSICS 2006»
15 years 6 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
COMGEO
2007
ACM
15 years 6 months ago
On incremental rendering of silhouette maps of a polyhedral scene
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt,...
CPHYSICS
2007
222views more  CPHYSICS 2007»
15 years 6 months ago
JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
A new software code for computing selected eigenvalues and associated eigenvectors of a real symmetric matrix is described. The eigenvalues are either the smallest or those closes...
Matthias Bollhöfer, Yvan Notay
« Prev « First page 1042 / 1348 Last » Next »