Sciweavers

4757 search results - page 49 / 952
» Generalized Posynomial Performance Modeling
Sort
View
ASIACRYPT
2008
Springer
13 years 11 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
RSEISP
2007
Springer
14 years 3 months ago
Generalizing Data in Natural Language
This paper concerns the development of a new direction in machine learning, called natural induction, which requires from computergenerated knowledge not only to have high predicti...
Ryszard S. Michalski, Janusz Wojtusiak
DAC
1995
ACM
14 years 22 days ago
A General Method for Compiling Event-Driven Simulations
Abstract—We present a new approach to event-driven simulation that does not use a centralized run-time event queue, yet is capable of handling arbitrary models, including those w...
Robert S. French, Monica S. Lam, Jeremy R. Levitt,...
SDM
2007
SIAM
140views Data Mining» more  SDM 2007»
13 years 10 months ago
A General Framework for Mining Concept-Drifting Data Streams with Skewed Distributions
In recent years, there have been some interesting studies on predictive modeling in data streams. However, most such studies assume relatively balanced and stable data streams but...
Jing Gao, Wei Fan, Jiawei Han, Philip S. Yu
NIPS
2001
13 years 10 months ago
On the Generalization Ability of On-Line Learning Algorithms
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...