Sciweavers

654 search results - page 91 / 131
» On the Approximation of Computing Evolutionary Trees
Sort
View
DAM
2011
15 years 28 days ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz
QOSIP
2005
Springer
15 years 11 months ago
Unicast and Multicast QoS Routing with Multiple Constraints
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
Dan Wang, Funda Ergün, Zhan Xu
CGF
2004
108views more  CGF 2004»
15 years 5 months ago
Interference Detection for Subdivision Surfaces
Accurate and robust interference detection and ray-tracing of subdivision surfaces requires safe linear approximations. Approximation of the limit surface by the subdivided contro...
Xiaobin Wu, Jörg Peters
FTDB
2011
98views more  FTDB 2011»
14 years 9 months ago
Secure Distributed Data Aggregation
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...
Haowen Chan, Hsu-Chun Hsiao, Adrian Perrig, Dawn S...
ALMOB
2008
85views more  ALMOB 2008»
15 years 6 months ago
Noisy: Identification of problematic columns in multiple sequence alignments
Motivation: Sequence-based methods for phylogenetic reconstruction from (nucleic acid) sequence data are notoriously plagued by two effects: homoplasies and alignment errors. Larg...
Andreas W. M. Dress, Christoph Flamm, Guido Fritzs...