Sciweavers

153 search results - page 16 / 31
» Fast and effective histogram construction
Sort
View
86
Voted
TOIS
2002
97views more  TOIS 2002»
14 years 9 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
ICASSP
2011
IEEE
14 years 1 months ago
Fast adaptive variational sparse Bayesian learning with automatic relevance determination
In this work a new adaptive fast variational sparse Bayesian learning (V-SBL) algorithm is proposed that is a variational counterpart of the fast marginal likelihood maximization ...
Dmitriy Shutin, Thomas Buchgraber, Sanjeev R. Kulk...
CGI
2003
IEEE
15 years 3 months ago
Fast Volumetric Display of Natural Gaseous Phenomena
Mesh simplification algorithms play an important role in computer graphics. In particular, view-dependent simplification methods are utilized widely to reduce the geometric comp...
Stefan Röttger, Thomas Ertl
VVS
2000
IEEE
171views Visualization» more  VVS 2000»
15 years 2 months ago
Fast CSG voxelization by frame buffer pixel mapping
This paper describes a fast algorithm for the volume conversion and rendering of CSG models constructed from both geometric and volumetric primitives. Using 3D texture mapping and...
Shiaofen Fang, Duoduo Liao
ICDE
2006
IEEE
154views Database» more  ICDE 2006»
15 years 3 months ago
Efficient Image Classification on Vertically Decomposed Data
Organizing digital images into semantic categories is imperative for effective browsing and retrieval. In large image collections, an efficient algorithm is crucial to quickly cat...
Taufik Abidin, Aijuan Dong, Honglin Li, William Pe...