2669 search results - page 219 / 534 » Complex Spatial Relationships |
124
click to vote
CHI
1995
ACM
15 years 6 months ago
1995
ACM
Large information spaces are often difficult to access efficiently and intuitively. We are exploring Pad++, a graphical interface system based on zooming, as an alternative to tra...
148
Voted
CIAC
2010
Springer
15 years 6 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
139
click to vote
NIPS
2008
15 years 4 months ago
2008
We introduce a family of unsupervised algorithms, numerical taxonomy clustering, to simultaneously cluster data, and to learn a taxonomy that encodes the relationship between the ...
118
Voted
AAAI
2006
15 years 4 months ago
2006
The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
109
click to vote
ICAD
2004
15 years 4 months ago
2004
This project is concerned with the development and evaluation of an integrated approach to sound-based access to spreadsheets. The primary target user population is visually impai...