20066 search results - page 268 / 4014 » T Spaces |
175
click to vote
COMPGEOM
1997
ACM
15 years 11 months ago
1997
ACM
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...
244
click to vote
PODS
1997
ACM
15 years 11 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
204
click to vote
ICS
1997
Tsinghua U.
15 years 11 months ago
1997
Tsinghua U.
Program slicing is an analysis that answers questions such as \Which statements might a ect the computation of variable v at statement s?" or \Which statements depend on the ...
155
Voted
CHI
1996
ACM
15 years 11 months ago
1996
ACM
: This paper describes techniques for maximizing the efficient use of small screen space by combining delayed response with semi-transparency of control objects ("widgets"...
168
click to vote
EWHCI
1993
15 years 10 months ago
1993
One of the new design goals in Human Computer Interaction is to extend the sensory-motor capabilities of computer systems to better match the natural communication means of human b...