Sciweavers

3630 search results - page 228 / 726
» Fast Marching Methods
Sort
View
TOG
2008
106views more  TOG 2008»
15 years 6 months ago
Fast modal sounds with scalable frequency-domain synthesis
Audio rendering of impact sounds, such as those caused by falling objects or explosion debris, adds realism to interactive 3D audiovisual applications, and can be convincingly ach...
Nicolas Bonneel, George Drettakis, Nicolas Tsingos...
SI3D
2012
ACM
14 years 2 months ago
Fast, effective BVH updates for animated scenes
Bounding volume hierarchies (BVHs) are a popular acceleration structure choice for animated scenes rendered with ray tracing. This is due to the relative simplicity of refitting ...
Daniel Kopta, Thiago Ize, Josef B. Spjut, Erik Bru...
WWW
2008
ACM
16 years 7 months ago
Floatcascade learning for fast imbalanced web mining
This paper is concerned with the problem of Imbalanced Classification (IC) in web mining, which often arises on the web due to the "Matthew Effect". As web IC applicatio...
Xiaoxun Zhang, Xueying Wang, Honglei Guo, Zhili Gu...
HPCA
2009
IEEE
16 years 7 months ago
Versatile prediction and fast estimation of Architectural Vulnerability Factor from processor performance metrics
The shrinking processor feature size, lower threshold voltage and increasing clock frequency make modern processors highly vulnerable to transient faults. Architectural Vulnerabil...
Lide Duan, Bin Li, Lu Peng
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 6 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis