3678 search results - page 521 / 736 » On the Stable Paths Problem |
172
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
193
click to vote
AICT
2006
IEEE
16 years 1 months ago
2006
IEEE
An open problem in structured overlay networks is related to the anonymity to be provided to recipients, namely, those nodes who respond to request messages. Such a feature is of ...
167
click to vote
DIAL
2006
IEEE
16 years 1 months ago
2006
IEEE
It is an important topic for segmentation on how to merge the over-segmented subimages of characters into integral characters. The conventional character segmentation has been mos...
175
click to vote
GLOBECOM
2006
IEEE
16 years 1 months ago
2006
IEEE
— This paper presents a complete solution to the problem of how to parametrise cluster-based stochastic MIMO channel models from measurement data, with minimum user intervention....
154
click to vote
IROS
2006
IEEE
16 years 1 months ago
2006
IEEE
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...