1972 search results - page 94 / 395 » connection 2008 |
163
click to vote
COMGEO
2008
ACM
15 years 5 months ago
2008
ACM
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
160
click to vote
SAC
2008
ACM
15 years 5 months ago
2008
ACM
Generating adequate recommendations for newcomers is a hard problem for a recommender system (RS) due to lack of detailed user profiles and social preference data. Empirical evide...
141
Voted
TON
2008
15 years 5 months ago
2008
This paper presents a methodology for protecting low-priority best-effort (BE) traffic in a network domain that provides both virtual-circuit routing with bandwidth reservation for...
155
click to vote
CCCG
2008
15 years 7 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
148
click to vote
CSC
2008
15 years 7 months ago
2008
Complex network models such as Kauffman's NK model have been shown to have interesting phase transitional properties as the connectivity is varied. Conventional network and g...