Sciweavers

3428 search results - page 220 / 686
» Making the Case
Sort
View
114
Voted
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
15 years 6 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
IKE
2003
15 years 6 months ago
The Research of the Development of an Intelligent Knowledge Service Model
Traditional knowledge management mechanism focused on the re-usage of knowledge library. However, it lacks the ability of knowledge innovation and co-creation. Meanwhile, employee...
Bih-Yaw Shih
137
Voted
MMNS
2003
135views Multimedia» more  MMNS 2003»
15 years 6 months ago
Pervasive Accounting of Resource Consumption for Wireless Services with Adaptive QoS
Wireless communications and device miniaturization are enabling pervasive scenarios where the limited resource availability and the wide heterogeneity of access terminals make cruc...
Paolo Bellavista, Antonio Corradi, Silvia Vecchi
NIPS
2003
15 years 6 months ago
On the Dynamics of Boosting
In order to understand AdaBoost’s dynamics, especially its ability to maximize margins, we derive an associated simplified nonlinear iterated map and analyze its behavior in lo...
Cynthia Rudin, Ingrid Daubechies, Robert E. Schapi...
AAAI
2000
15 years 6 months ago
A Unified Bias-Variance Decomposition for Zero-One and Squared Loss
The bias-variance decomposition is a very useful and widely-used tool for understanding machine-learning algorithms. It was originally developed for squared loss. In recent years,...
Pedro Domingos