3825 search results - page 264 / 765 » More on pooling spaces |
156
click to vote
CHINZ
2007
ACM
15 years 10 months ago
2007
ACM
Research has been done into improving the means by which we organise and manage information. The usefulness of 2D versus 3D interfaces and environments has also been debated and e...
163
click to vote
SIGARCH
2008
15 years 6 months ago
2008
As CMP platforms are widely adopted, more and more cores are integrated on to the die. To reduce the off-chip memory access, the last level cache is usually organized as a distribu...
302
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
195
click to vote
SI3D
2010
ACM
15 years 12 months ago
2010
ACM
We introduce Linear Efficient Antialiased Normal (LEAN) Mapping, a method for real-time filtering of specular highlights in bump and normal maps. The method evaluates bumps as p...
159
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...