Sciweavers

75 search results - page 12 / 15
» Optimal Suffix Tree Construction with Large Alphabets
Sort
View
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 8 months ago
Why neighbor-joining works
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
Radu Mihaescu, Dan Levy, Lior Pachter
DRR
2010
13 years 11 months ago
Time and space optimization of document content classifiers
Scaling up document-image classifiers to handle an unlimited variety of document and image types poses serious challenges to conventional trainable classifier technologies. Highly...
Dawei Yin, Henry S. Baird, Chang An
IANDC
2008
122views more  IANDC 2008»
13 years 8 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
TPDS
2008
175views more  TPDS 2008»
13 years 8 months ago
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
Olivier Beaumont, Larry Carter, Jeanne Ferrante, A...
TIT
2010
111views Education» more  TIT 2010»
13 years 3 months ago
Designing floating codes for expected performance
Floating codes are codes designed to store multiple values in a Write Asymmetric Memory, with applications to flash memory. In this model, a memory consists of a block of n cells, ...
Flavio Chierichetti, Hilary Finucane, Zhenming Liu...