921 search results - page 128 / 185 » New Data Structures for Orthogonal Range Searching |
126
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
134
click to vote
VISUALIZATION
2005
IEEE
15 years 9 months ago
2005
IEEE
We describe a new dynamic level-of-detail (LOD) technique that allows real-time rendering of large tetrahedral meshes. Unlike approaches that require hierarchies of tetrahedra, ou...
135
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
161
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
140
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics t...