3471 search results - page 116 / 695 » Obstacle Numbers of Graphs |
113
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Networks of workstations are fast becoming the standard environment for parallel applications. However, the use of “found” resources as a platform for tightly-coupled runtime ...
160
Voted
CAPTECH
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. This paper presents a new technique for computing collisionfree navigation motions from task-level commands for animated human characters in interactive virtual environme...
97
Voted
EMNLP
2008
15 years 4 months ago
2008
Obtaining labeled data is a significant obstacle for many NLP tasks. Recently, online games have been proposed as a new way of obtaining labeled data; games attract users by being...
110
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
DM
2000
15 years 2 months ago
2000
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.