Sciweavers

2254 search results - page 141 / 451
» Computing the minimal covering set
Sort
View
NIPS
2008
15 years 2 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
IS
2008
15 years 1 months ago
Integration of complex archeology digital libraries: An ETANA-DL experience
In this paper, we formalize the digital library (DL) integration problem and propose an overall approach based on the 5S (streams, structures, spaces, scenarios, and societies) fr...
Rao Shen, Naga Srinivas Vemuri, Weiguo Fan, Edward...
142
Voted
ASE
1998
152views more  ASE 1998»
15 years 21 days ago
Apel: A Graphical Yet Executable Formalism for Process Modeling
Software process improvement requires high level formalisms for describing project-specific, organizational and quality aspects. These formalisms must be convenient not only for ...
Samir Dami, Jacky Estublier, Mahfoud Amiour
126
Voted
VLDB
2010
ACM
190views Database» more  VLDB 2010»
14 years 11 months ago
Continuous authentication on relational streams
According to the database outsourcing model, a data owner delegates database functionality to a thirdparty service provider, which answers queries received from clients. Authentic...
Stavros Papadopoulos, Yin Yang, Dimitris Papadias
ATAL
2008
Springer
15 years 3 months ago
Coalitional skill games
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...
Yoram Bachrach, Jeffrey S. Rosenschein