11211 search results - page 1648 / 2243 » Rank-Sensitive Data Structures |
232
Voted
NIPS
2004
15 years 8 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
163
click to vote
GRAPHICSINTERFACE
2003
15 years 8 months ago
2003
Collision detection is a vital task in almost all forms of computer animation and physical simulation. It is also one of the most computationally expensive, and therefore a freque...
161
click to vote
GRAPHICSINTERFACE
2003
15 years 8 months ago
2003
In this paper we reconsider pairwise collision detection for rigid motions using a k-DOP bounding volume hierarchy. This data structure is particularly attractive because it is eq...
185
click to vote
IADIS
2003
15 years 8 months ago
2003
Sure that quality applications must be well thought and described before the development phase and that a design methodology can be much more than a help in most occasions, we pro...
211
click to vote
NIPS
2001
15 years 8 months ago
2001
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...