1124 search results - page 127 / 225 » Constructing Common Information Spaces |
124
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
135
click to vote
CHI
2010
ACM
15 years 11 months ago
2010
ACM
Tabletop computers based on diffuse illumination can track fiducial markers placed on the table’s surface. In this paper, we demonstrate how to do the same with objects arranged...
132
click to vote
ISMAR
2002
IEEE
15 years 9 months ago
2002
IEEE
There is a problem in the spatial and temporal separation between the varying forms of representation used in urban design. Sketches, physical models, and more recently computatio...
118
click to vote
CHINZ
2005
ACM
15 years 6 months ago
2005
ACM
re the use of abstracted screenshots as part of a new help interface. Graphstract, an implementation of a graphical help system, extends the ideas of textually oriented Minimal Ma...
145
click to vote
NIPS
2004
15 years 5 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...