4850 search results - page 435 / 970 » Approximate Data Structures with Applications |
225
click to vote
EGH
2010
Springer
15 years 5 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
249
click to vote
BIRTHDAY
2003
Springer
16 years 25 days ago
2003
Springer
Abstract: In the automotive and aerospace industry, millions of technical documents are generated during the development of complex engineering products. Particularly, the universa...
248
click to vote
GI
1998
Springer
15 years 12 months ago
1998
Springer
"KnowledgeMiner" was designed to support the knowledge extraction process on a highly automated level. Implemented are 3 different GMDH-type self-organizing modeling algo...
257
click to vote
ML
2008
ACM
15 years 7 months ago
2008
ACM
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
240
click to vote
KDD
2006
ACM
16 years 8 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...