Sciweavers

1941 search results - page 293 / 389
» On the Hardness of Approximate Reasoning
Sort
View
ACL
2011
14 years 10 months ago
Jointly Learning to Extract and Compress
We learn a joint model of sentence extraction and compression for multi-document summarization. Our model scores candidate summaries according to a combined linear model whose fea...
Taylor Berg-Kirkpatrick, Dan Gillick, Dan Klein
CAV
2012
Springer
231views Hardware» more  CAV 2012»
13 years 8 months ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
AAAI
2012
13 years 8 months ago
POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration Testing
Penetration Testing is a methodology for assessing network security, by generating and executing possible hacking attacks. Doing so automatically allows for regular and systematic...
Carlos Sarraute, Olivier Buffet, Jörg Hoffman...
GIS
2004
ACM
16 years 7 months ago
Energy efficient exact kNN search in wireless broadcast environments
The advances in wireless communication and decreasing costs of mobile devices have enabled users to access desired information at any time. Coupled with positioning technologies l...
Bugra Gedik, Aameek Singh, Ling Liu
WWW
2003
ACM
16 years 6 months ago
Text joins in an RDBMS for web data integration
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...