Sciweavers

3208 search results - page 151 / 642
» A Lower Bound for Primality
Sort
View
APAL
2004
81views more  APAL 2004»
15 years 6 months ago
The complexity of first-order and monadic second-order logic revisited
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower...
Markus Frick, Martin Grohe
TCBB
2010
122views more  TCBB 2010»
15 years 4 months ago
On the Complexity of uSPR Distance
We show that subtree prune and regraft (uSPR) distance on unrooted trees is fixed parameter tractable with respect to the distance. We also make progress on a conjecture of Steel...
Maria Luisa Bonet, Katherine St. John
DCG
2011
15 years 1 months ago
More Colourful Simplices
We show that any point in the convex hull of each of (d +1) sets of (d +1) points in general position in Rd is contained in at least (d + 1)2/2 simplices with one vertex from each ...
Antoine Deza, Tamon Stephen, Feng Xie
ICASSP
2011
IEEE
14 years 10 months ago
Analyzing the performance of error-prone relay networks
In this paper, we provide a semi-analytical method for predicting the upper and lower bound of the end-to-end mutual information for a relay network with practical codes and diffe...
Sebastian Vorköper, Volker Kühn
INFOCOM
2007
IEEE
16 years 23 days ago
The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
Junshan Zhang, Dong Zheng, Mung Chiang