Sciweavers

16430 search results - page 917 / 3286
» On Computable Tree Functions
Sort
View
JCB
2006
124views more  JCB 2006»
15 years 7 months ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
16 years 9 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei
191
Voted
CEC
2008
IEEE
16 years 2 months ago
A parallel surrogate-assisted multi-objective evolutionary algorithm for computationally expensive optimization problems
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
Anna Syberfeldt, Henrik Grimm, Amos Ng, Robert Ivo...
ACSAC
2006
IEEE
16 years 1 months ago
Engineering Sufficiently Secure Computing
We propose an architecture of four complimentary technologies increasingly relevant to a growing number of home users and organizations: cryptography, separation kernels, formal v...
Brian Witten
185
Voted
ISCC
2005
IEEE
16 years 1 months ago
Optimal Delay-Constrained Minimum Cost Loop Algorithm for Local Computer Network
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
Yong-Jin Lee, Mohammed Atiquzzaman