Sciweavers

522 search results - page 16 / 105
» The 3-Steiner Root Problem
Sort
View
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 4 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
100
Voted
ICC
2007
IEEE
15 years 10 months ago
Root Nyquist Pulses with an Energy Criterion
Abstract— The design of root-Nyquist pulses with the maximum possible energy concentration of the power spectrum is a fundamental problem is communications engineering. Since the...
Ritesh Sood, Hong Xiao
WG
2004
Springer
15 years 9 months ago
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
Zhi-Zhong Chen, Tatsuie Tsukiji
ICDIM
2007
IEEE
15 years 10 months ago
Exploration of multiple roots for a polynomial system
Several problems from engineering, chemistry, medicine, etc. can be formulated as a system of equations. Finding a solution for such a system sometimes requires high computational...
Crina Grosan, Ajith Abraham
FOCS
2006
IEEE
15 years 10 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau