Sciweavers

1096 search results - page 96 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
RECOMB
2005
Springer
16 years 6 months ago
Information Theoretic Approaches to Whole Genome Phylogenies
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...
David Burstein, Igor Ulitsky, Tamir Tuller, Benny ...
JCB
2006
124views more  JCB 2006»
15 years 6 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 ...
EDBT
2010
ACM
153views Database» more  EDBT 2010»
16 years 1 months ago
Suggestion of promising result types for XML keyword search
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...
Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang
TSMC
2002
142views more  TSMC 2002»
15 years 6 months ago
Adaptive color reduction
Abstract--This paper proposes a new algorithm for the reduction of the number of colors in an image. The proposed adaptive color reduction (ACR) technique achieves color reduction ...
Nikos Papamarkos, Antonios Atsalakis, Charalambos ...
ICCAD
1994
IEEE
109views Hardware» more  ICCAD 1994»
15 years 10 months ago
Efficient breadth-first manipulation of binary decision diagrams
We propose new techniques for efficient breadth-first iterative manipulation of ROBDDs. Breadth-first iterative ROBDD manipulation can potentially reduce the total elapsed time by...
Pranav Ashar, Matthew Cheong