5659 search results - page 243 / 1132 » Comparing Clusterings in Space |
260
click to vote
VLDB
2004
ACM
16 years 6 months ago
2004
ACM
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
136
click to vote
SAC
2009
ACM
16 years 19 days ago
2009
ACM
Shelf space allocation is the problem of efficiently arranging retail products on shelves in order to maximise profit, improve stock control, improve customer satisfaction, etc. ...
161
click to vote
SI3D
2009
ACM
16 years 19 days ago
2009
ACM
Physically plausible illumination at real-time framerates is often achieved using approximations. One popular example is ambient occlusion (AO), for which very simple and efficie...
152
click to vote
INFOCOM
2006
IEEE
15 years 12 months ago
2006
IEEE
— Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerni...
142
click to vote
IPPS
2006
IEEE
15 years 12 months ago
2006
IEEE
Phylospaces is a novel framework for reconstructing evolutionary trees in tuple space, a distributed shared memory that permits processes to communicate and coordinate with each o...