Sciweavers

6142 search results - page 841 / 1229
» The Complexity of Partition Functions
Sort
View
CAD
1998
Springer
15 years 6 months ago
Knot-removal surface fairing using search strategies
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
Stefanie Hahmann, Stefan Konz
JASSS
1998
82views more  JASSS 1998»
15 years 6 months ago
Qualitative modeling and simulation of socio-economic phenomena
This paper describes an application of recently developed qualitative reasoning techniques to complex, socio{economic allocation problems. We explain why we believe traditional op...
Giorgio Brajnik, Marji Lines
JMLR
2002
89views more  JMLR 2002»
15 years 6 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor
ML
2002
ACM
145views Machine Learning» more  ML 2002»
15 years 6 months ago
Boosting Methods for Regression
In this paper we examine ensemble methods for regression that leverage or "boost" base regressors by iteratively calling them on modified samples. The most successful lev...
Nigel Duffy, David P. Helmbold
177
Voted
TCAD
1998
95views more  TCAD 1998»
15 years 6 months ago
High-precision interconnect analysis
— Integrated circuits have evolved to a stage where interconnections significantly limit their performance and functional complexity. We introduce a set of tools to perform high...
Rui Martins, Wolfgang Pyka, Rainer Sabelka, Siegfr...