1301 search results - page 153 / 261 » Bounded Version Vectors |
113
Voted
COLOGNETWENTE
2009
15 years 1 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
114
Voted
GD
2008
Springer
15 years 1 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
CORR
2010
Springer
15 years 23 days ago
2010
Springer
Inspired by biological communication systems, molecular communication has been proposed as a viable scheme to communicate between nano-sized devices separated by a very short dist...
102
click to vote
CORR
2010
Springer
15 years 23 days ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
63
Voted
ENTCS
2008
15 years 22 days ago
2008
We de ne the e ective integrability of Fine-computable functions and e ectivize some fundamental limit theorems in the theory of Lebesgue integral such as Bounded Convergence Theo...