Sciweavers

1068 search results - page 153 / 214
» Extremely randomized trees
Sort
View
62
Voted
CAD
2004
Springer
15 years 11 days ago
Computer modeling approach for microsphere-packed bone scaffold
A computer modeling approach for constructing a three-dimensional microsphere-packed bone graft structure is presented. The modeling approach consists of both geometric and CAD-ba...
Pallavi Lal, Wei Sun
107
Voted
SIGIR
2002
ACM
15 years 5 days ago
PageRank, HITS and a unified framework for link analysis
Two popular webpage ranking algorithms are HITS and PageRank. HITS emphasizes mutual reinforcement between authority and hub webpages, while PageRank emphasizes hyperlink weight n...
Chris H. Q. Ding, Xiaofeng He, Parry Husbands, Hon...
104
Voted
SPIRE
2010
Springer
14 years 11 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
JISE
2010
144views more  JISE 2010»
14 years 7 months ago
Variant Methods of Reduced Set Selection for Reduced Support Vector Machines
In dealing with large datasets the reduced support vector machine (RSVM) was proposed for the practical objective to overcome the computational difficulties as well as to reduce t...
Li-Jen Chien, Chien-Chung Chang, Yuh-Jye Lee
163
Voted
TCAD
2010
168views more  TCAD 2010»
14 years 7 months ago
An MILP-Based Performance Analysis Technique for Non-Preemptive Multitasking MPSoC
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Hoeseok Yang, Sungchan Kim, Soonhoi Ha