Sciweavers

2912 search results - page 352 / 583
» Logistic Model Trees
Sort
View
ICML
2000
IEEE
16 years 5 months ago
FeatureBoost: A Meta-Learning Algorithm that Improves Model Robustness
Most machine learning algorithms are lazy: they extract from the training set the minimum information needed to predict its labels. Unfortunately, this often leads to models that ...
Joseph O'Sullivan, John Langford, Rich Caruana, Av...
141
Voted
3DIM
2005
IEEE
15 years 10 months ago
Multi-Resolution Modeling and Locally Refined Collision Detection for Haptic Interaction
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
Peiran Liu, Xiaojun Shen, Nicolas D. Georganas, Ge...
112
Voted
ATAL
2005
Springer
15 years 10 months ago
Modeling complex multi-issue negotiations using utility graphs
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
Valentin Robu, D. J. A. Somefun, Johannes A. La Po...
ICCAD
1996
IEEE
74views Hardware» more  ICCAD 1996»
15 years 8 months ago
Optimal non-uniform wire-sizing under the Elmore delay model
We consider non-uniform wire-sizing for general routing trees under the Elmore delay model. Three minimization objectives are studied: 1) total weighted sink-delays; 2) total area...
Chung-Ping Chen, Hai Zhou, D. F. Wong
IJCAI
2007
15 years 6 months ago
Dynamically Weighted Hidden Markov Model for Spam Deobfuscation
Spam deobfuscation is a processing to detect obfuscated words appeared in spam emails and to convert them back to the original words for correct recognition. Lexicon tree hidden M...
Seunghak Lee, Iryoung Jeong, Seungjin Choi