1308 search results - page 50 / 262 » Let's Have a Conversation |
AVI
2000
15 years 14 days ago
2000
To support users in querying geographic databases we have developed a system that lets people sketch what they are looking for. It closes the gap between user and information syst...
IPL
2008
14 years 11 months ago
2008
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
JCT
2000
14 years 11 months ago
2000
Let Q(k, l) be a poset whose Hasse diagram is a regular spider with k+1 legs having the same length l (cf. Fig. 1). We show that for any n 1 the nth cartesian power of
GC
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
69
Voted
CHI
2002
ACM
15 years 11 months ago
2002
ACM
Most studies about instant messaging (IM) are based on self-report data. We logged thousands of real IM conversations and examined them to find characteristic patterns of IM use i...