4744 search results - page 199 / 949 » Connected Computing |
133
click to vote
COMGEO
2008
ACM
15 years 3 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...
140
Voted
SAC
2008
ACM
15 years 3 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...
117
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
MPI (Message Passing Interface) is a proposed message passing standard for development of efficient and portable parallel programs. An implementation of MPI is presented and eval...
120
Voted
ICDCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We propose a peer-to-peer architecture designed to overcome asymmetries in upload/download speeds that are typical in end-user dialup, broadband and cellular wireless Internet con...
136
Voted
WAOA
2007
Springer
15 years 9 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...