Sciweavers

4074 search results - page 804 / 815
» Defining Computational Aesthetics
Sort
View
TCS
2008
13 years 8 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
TIP
2008
134views more  TIP 2008»
13 years 8 months ago
Higher Order SVD Analysis for Dynamic Texture Synthesis
Videos representing flames, water, smoke, etc. are often defined as dynamic textures: "textures" because they are characterized by redundant repetition of a pattern and &...
Roberto Costantini, Luciano Sbaiz, Sabine Süs...
BMCBI
2005
117views more  BMCBI 2005»
13 years 8 months ago
An SVM-based system for predicting protein subnuclear localizations
Background: The large gap between the number of protein sequences in databases and the number of functionally characterized proteins calls for the development of a fast computatio...
Zhengdeng Lei, Yang Dai
BMCBI
2005
151views more  BMCBI 2005»
13 years 8 months ago
stam - a Bioconductor compliant R package for structured analysis of microarray data
Background: Genome wide microarray studies have the potential to unveil novel disease entities. Clinically homogeneous groups of patients can have diverse gene expression profiles...
Claudio Lottaz, Rainer Spang
BMCBI
2005
115views more  BMCBI 2005»
13 years 8 months ago
Statistical distributions of optimal global alignment scores of random protein sequences
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
Hongxia Pang, Jiaowei Tang, Su-Shing Chen, Shiheng...