239 search results - page 26 / 48 » Hardness and algorithms for rainbow connection |
126
click to vote
MOBISYS
2009
ACM
16 years 9 days ago
2009
ACM
We design, implement, and evaluate a vehicular communication system that improves uplink connectivity through multi-lobe beam pattern switching on a smart antenna. Directionality ...
ESA
2010
Springer
15 years 26 days ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
111
click to vote
STOC
2010
ACM
15 years 3 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
ICDAR
2009
IEEE
15 years 6 months ago
2009
IEEE
We propose a new algorithm for segmentation of off-line handwritten Arabic words. The algorithm segments the connected letters to smaller segments each of which contains no more t...