1099 search results - page 169 / 220 » On the Complexity of Computing Evolutionary Trees |
113
click to vote
MOR
2010
15 years 2 months ago
2010
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
145
click to vote
WINET
2010
15 years 2 months ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
152
click to vote
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
137
click to vote
AAAI
2011
14 years 4 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
126
click to vote
ALMOB
2008
15 years 4 months ago
2008
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...