Sciweavers

1421 search results - page 124 / 285
» Algorithms for subsequence combinatorics
Sort
View
EVOW
2005
Springer
15 years 10 months ago
Genetic Paint: A Search for Salient Paintings
The contribution of this paper is a novel non-photorealistic rendering (NPR) algorithm for rendering real images in an impasto painterly style. We argue that figurative artworks a...
John P. Collomosse, Peter M. Hall
ICA
2004
Springer
15 years 10 months ago
Some Gradient Based Joint Diagonalization Methods for ICA
Abstract. We present a set of gradient based orthogonal and nonorthogonal matrix joint diagonalization algorithms. Our approach is to use the geometry of matrix Lie groups to devel...
Bijan Afsari, Perinkulam S. Krishnaprasad
DNA
2007
Springer
106views Bioinformatics» more  DNA 2007»
15 years 8 months ago
Hardware Acceleration for Thermodynamic Constrained DNA Code Generation
Reliable DNA computing requires a large pool of oligonucleotides that do not produce cross-hybridize. In this paper, we present a transformed algorithm to calculate the maximum wei...
Qinru Qiu, Prakash Mukre, Morgan Bishop, Daniel J....
CGI
2004
IEEE
15 years 8 months ago
Exploiting Temporal Coherence in Final Gathering for Dynamic Scenes
Efficient global illumination computation in dynamically changing environments is an important practical problem. In high-quality animation rendering costly "final gathering&...
Takehiro Tawara, Karol Myszkowski, Hans-Peter Seid...
TREC
2004
15 years 5 months ago
Juru at TREC 2004: Experiments with Prediction of Query Difficulty
Our experiments in the Robust track this year focused on predicting query difficulty and using this prediction for improving information retrieval. We developed two prediction alg...
Elad Yom-Tov, Shai Fine, David Carmel, Adam Darlow...