Sciweavers

1301 search results - page 153 / 261
» Bounded Version Vectors
Sort
View
COLOGNETWENTE
2009
13 years 12 months ago
Colored Trees in Edge-Colored Graphs
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...
A. Abouelaoualim, V. Borozan, Yannis Manoussakis, ...
GD
2008
Springer
13 years 11 months ago
Crossing and Weighted Crossing Number of Near-Planar Graphs
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...
Sergio Cabello, Bojan Mohar
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 10 months ago
Molecular Communication Using Brownian Motion with Drift
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...
Sachin Kadloor, Raviraj S. Adve, Andrew W. Eckford
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 10 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
ENTCS
2008
87views more  ENTCS 2008»
13 years 10 months ago
Integral of Fine Computable functions and Walsh Fourier series
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...
Takakazu Mori, Mariko Yasugi, Yoshiki Tsujii