Sciweavers

448 search results - page 48 / 90
» Dynamic Algorithms for the Dyck Languages
Sort
View
EMNLP
2011
13 years 9 months ago
Training a Log-Linear Parser with Loss Functions via Softmax-Margin
Log-linear parsing models are often trained by optimizing likelihood, but we would prefer to optimise for a task-specific metric like Fmeasure. Softmax-margin is a convex objecti...
Michael Auli, Adam Lopez
PUC
2008
137views more  PUC 2008»
14 years 9 months ago
Middleware support for the deployment of ubiquitous software components
A number of emerging distributed platforms include xed and robust workstations but, like dynamic and pervasive networks, are often built from mobile and resource-constrained device...
Didier Hoareau, Yves Mahéo
AIPS
2009
14 years 11 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
15 years 10 months ago
MayBMS: a probabilistic database management system
MayBMS is a state-of-the-art probabilistic database management system which leverages the strengths of previous database research for achieving scalability. As a proof of concept ...
Jiewen Huang, Lyublena Antova, Christoph Koch, Dan...
PASTE
2004
ACM
15 years 3 months ago
Evaluating the imprecision of static analysis
This work discusses two non-traditional approaches for evaluating the imprecision of static analysis. The approaches are based on proofs of feasibility or infeasibility that are c...
Atanas Rountev, Scott Kagan, Michael Gibas