Sciweavers

5183 search results - page 845 / 1037
» The Complexity of Distributions
Sort
View
IDA
2002
Springer
15 years 6 months ago
Online classification of nonstationary data streams
Most classification methods are based on the assumption that the data conforms to a stationary distribution. However, the real-world data is usually collected over certain periods...
Mark Last
CGF
1998
127views more  CGF 1998»
15 years 6 months ago
Getting Rid of Links in Hierarchical Radiosity
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
Marc Stamminger, Hartmut Schirmacher, Philipp Slus...
AC
1999
Springer
15 years 6 months ago
Architectures and patterns for developing high performance real-time ORB endsystems
Many types of applications can benefit from flexible and open middleware. CORBA is an emerging middleware standard for Object Request Brokers (ORBs) that simplifies the developmen...
Douglas C. Schmidt, David L. Levine, Chris Clevela...
ML
2002
ACM
178views Machine Learning» more  ML 2002»
15 years 6 months ago
Metric-Based Methods for Adaptive Model Selection and Regularization
We present a general approach to model selection and regularization that exploits unlabeled data to adaptively control hypothesis complexity in supervised learning tasks. The idea ...
Dale Schuurmans, Finnegan Southey
PE
1998
Springer
104views Optimization» more  PE 1998»
15 years 6 months ago
Analysis of Transient of the Datagram Traffic for a Demand Assignment TDMA
- A modified version of the datagram capacity assignment of the FODA access scheme, named FODA/IBEA, is briefly presented. The main difference from the previous version (besides th...
Nedo Celandroni