Sciweavers

1594 search results - page 121 / 319
» Fast Prediction on a Tree
Sort
View
CG
2008
Springer
13 years 8 months ago
Fast, parallel, and asynchronous construction of BVHs for ray tracing animated scenes
Recent developments have produced several techniques for interactive ray tracing of dynamic scenes. In particular, bounding volume hierarchies (BVHs) are efficient acceleration st...
Ingo Wald, Thiago Ize, Steven G. Parker
ICIP
2010
IEEE
13 years 6 months ago
Fast geometric re-ranking for image-based retrieval
We present a fast and efficient geometric re-ranking method that can be incorporated in a feature based image-based retrieval system that utilizes a Vocabulary Tree (VT). We form ...
Sam S. Tsai, David Chen, Gabriel Takacs, Vijay Cha...
IMCSIT
2010
13 years 6 months ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski
ESEM
2007
ACM
14 years 2 days ago
The Effects of Over and Under Sampling on Fault-prone Module Detection
The goal of this paper is to improve the prediction performance of fault-prone module prediction models (fault-proneness models) by employing over/under sampling methods, which ar...
Yasutaka Kamei, Akito Monden, Shinsuke Matsumoto, ...
AUSAI
1999
Springer
14 years 14 days ago
Generating Rule Sets from Model Trees
Model trees—decision trees with linear models at the leaf nodes—have recently emerged as an accurate method for numeric prediction that produces understandable models. However,...
Geoffrey Holmes, Mark Hall, Eibe Frank