Sciweavers

173 search results - page 16 / 35
» A Proof of the Two-path Conjecture
Sort
View
CPC
2006
73views more  CPC 2006»
13 years 7 months ago
Feasible Schedules for Rotating Transmissions
Motivated by a scheduling problem that arises in the study of optical networks we prove the following result, which is a variation of a conjecture of Haxell, Wilfong and Winkler. ...
Noga Alon
FOCM
2002
83views more  FOCM 2002»
13 years 7 months ago
A Rigorous ODE Solver and Smale's 14th Problem
We present an algorithm for computing rigorous solutions to a large class of ordinary differential equations. The main algorithm is based on a partitioning process and the use of i...
Warwick Tucker
TCS
2011
13 years 2 months ago
The transposition median problem is NP-complete
During the last years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures, where the m...
Martin Bader
WINE
2010
Springer
220views Economy» more  WINE 2010»
13 years 5 months ago
Threshold Models for Competitive Influence in Social Networks
The problem of influence maximization deals with choosing the optimal set of nodes in a social network so as to maximize the resulting spread of a technology (opinion, productowne...
Allan Borodin, Yuval Filmus, Joel Oren
ACCESSNETS
2009
Springer
13 years 5 months ago
Capacity of Two-Way Relay Channel
This paper investigates the capacity of a wireless two-way relay channel in which two end nodes exchange information via a relay node. The capacity is defined in the information-th...
Shengli Zhang, Soung Chang Liew, Hui Wang, Xiao-Hu...