7913 search results - page 254 / 1583 » Information Collection on a Graph |
80
Voted
SIGIR
2005
ACM
15 years 6 months ago
2005
ACM
101
Voted
NORDICHI
2006
ACM
15 years 6 months ago
2006
ACM
In this paper we discuss why access to mathematical graphs is problematic for visually impaired people. By a review of graph understanding theory and interviews with visually impa...
113
Voted
CHI
2010
ACM
15 years 5 months ago
2010
ACM
We present a tangible user interface (TUI) called Tangible Graph Builder, that has been designed to allow visually impaired users to access graph and chart-based data. We describe...
110
Voted
AIPS
2008
15 years 3 months ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
81
Voted
DM
2008
15 years 23 days ago
2008
A (d, d + 1)-graph is a graph whose vertices all have degrees in the set {d, d + 1}. Such a graph is semiregular. An (r, r + 1)-factorization of a graph G is a decomposition of G ...