Sciweavers

1559 search results - page 240 / 312
» Fundamentals of Generic Programming
Sort
View
70
Voted
ICML
2006
IEEE
15 years 10 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis
WWW
2006
ACM
15 years 10 months ago
From adaptation engineering to aspect-oriented context-dependency
The evolution of the Web requires to consider an increasing number of context-dependency issues. Therefore, in our research we focus on how to extend a Web application with additi...
Sven Casteleyn, Zoltán Fiala, Geert-Jan Hou...
CAV
2009
Springer
134views Hardware» more  CAV 2009»
15 years 10 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...
PODS
2005
ACM
124views Database» more  PODS 2005»
15 years 10 months ago
Diagnosis of asynchronous discrete event systems: datalog to the rescue!
We consider query optimization techniques for data intensive P2P applications. We show how to adapt an old technique from deductive databases, namely Query-Sub-Query (QSQ), to a s...
Serge Abiteboul, Stefan Haar, Tova Milo, Zoë ...
ICSE
2004
IEEE-ACM
15 years 10 months ago
Imposing a Memory Management Discipline on Software Deployment
The deployment of software components frequently fails because dependencies on other components are not declared explicitly or are declared imprecisely. This results in an incompl...
Eelco Dolstra, Eelco Visser, Merijn de Jonge