Sciweavers

195 search results - page 26 / 39
» A polynomial algorithm for the p-centdian problem on a tree
Sort
View
JCB
1998
105views more  JCB 1998»
13 years 7 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
ICALP
2005
Springer
14 years 1 months ago
The Generalized Deadlock Resolution Problem
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
Kamal Jain, Mohammad Taghi Hajiaghayi, Kunal Talwa...
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
14 years 1 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
CIIT
2004
144views Communications» more  CIIT 2004»
13 years 9 months ago
Load balancing for reliable multicast
New applications emerge along with the rapid growth of the Internet. Many functionalities other than packet forwarding are being proposed to be added into routers for supporting t...
Chao Gong, Ovidiu Daescu, Raja Jothi, Balaji Ragha...
INFFUS
2008
175views more  INFFUS 2008»
13 years 7 months ago
Adaptive optimization of join trees for multi-join queries over sensor streams
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...
Joseph S. Gomes, Hyeong-Ah Choi