Sciweavers

Share
270 search results - page 54 / 54
» Incremental Dependency Parsing Using Online Learning
Sort
View
EUROSYS
2006
ACM
12 years 3 months ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...
INFOCOM
2010
IEEE
11 years 5 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
WWW
2004
ACM
12 years 7 months ago
A smart hill-climbing algorithm for application server configuration
The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has led to an increase in the deployment of comp...
Bowei Xi, Zhen Liu, Mukund Raghavachari, Cathy H. ...
KDD
2000
ACM
153views Data Mining» more  KDD 2000»
11 years 10 months ago
The generalized Bayesian committee machine
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
Volker Tresp
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
9 years 9 months ago
Factoring past exposure in display advertising targeting
Online advertising is increasingly becoming more performance oriented, where the decision to show an advertisement to a user is made based on the user’s propensity to respond to...
Neha Gupta, Abhimanyu Das, Sandeep Pandey, Vijay K...
books