3267 search results - page 551 / 654 » Generalized quasirandom graphs |
149
click to vote
VRST
2003
ACM
15 years 10 months ago
2003
ACM
Virtual environments (VEs) allow users to experience and interact with a rich sensory environment, but most virtual worlds contain only sensory information similar to that which w...
175
click to vote
FSTTCS
2003
Springer
15 years 10 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
122
click to vote
ICMI
2003
Springer
15 years 9 months ago
2003
Springer
Informal presentations are a lightweight means for fast and convenient communication of ideas. People communicate their ideas to others on paper and whiteboards, which afford flui...
121
click to vote
UM
2010
Springer
15 years 9 months ago
2010
Springer
The effectiveness of support provided to virtual communities depends strongly on what we know about a particular community of people and in what areas the community needs support....
154
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...