Sciweavers

1511 search results - page 214 / 303
» Randomness, lowness and degrees
Sort
View
JCB
1998
105views more  JCB 1998»
15 years 6 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
MR
2002
62views Robotics» more  MR 2002»
15 years 6 months ago
Impact of circuit resistance on the breakdown voltage of tantalum chip capacitors
Experiments are described in this paper whose results suggest a clear mathematical relationship between total circuit resistance (including the capacitor's ESR) and the volta...
Erik K. Reed, Jonathan L. Paulsen
MP
1998
109views more  MP 1998»
15 years 6 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
VTC
2010
IEEE
162views Communications» more  VTC 2010»
15 years 4 months ago
Performance Evaluation of Joint Network-Channel Coding under a Real Network Topology Model
— Adaptive network coded cooperation (ANCC) has been proposed as an effective scheme to combine network and channel coding for cooperative wireless networks by matching network-o...
Kun Pang, Zihuai Lin, Yonghui Li, Branka Vucetic
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
15 years 4 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer