Sciweavers

1099 search results - page 82 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
CORR
2008
Springer
106views Education» more  CORR 2008»
14 years 10 months ago
Infinity-Norm Sphere-Decoding
Abstract--Promising approaches for efficient detection in multiple-input multiple-output (MIMO) wireless systems are based on sphere-decoding (SD). The conventional (and optimum) n...
Dominik Seethaler, Helmut Bölcskei
CP
2000
Springer
15 years 1 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
CGF
2005
126views more  CGF 2005»
14 years 9 months ago
Pen-and-Ink for BlobTree Implicit Models
New techniques are presented for rendering complex hierarchical skeletal implicit models in several pen-and-ink styles. A particle system is employed to find interesting areas on ...
Kevin Foster, Pauline Jepp, Brian Wyvill, Mario Co...
IJIT
2004
14 years 11 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
CEC
2008
IEEE
15 years 4 months ago
Potential and dynamics-based Particle Swarm Optimization
Abstract— The Particle Swarm Optimization (PSO) algorithm is a robust stochastic evolutionary computation technique based on the movement and intelligence of swarms. This paper p...
Hyungmin Park, Jong-Hwan Kim