Sciweavers

1023 search results - page 186 / 205
» A Formal Method for Program Slicing
Sort
View
ICML
2006
IEEE
16 years 2 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
2004
ACM
16 years 2 months ago
Parsing owl dl: trees or triples?
The Web Ontology Language (OWL) defines three classes of documents: Lite, DL and Full. All RDF/XML documents are OWL Full documents, some OWL Full documents are also OWL DL docume...
Sean Bechhofer, Jeremy J. Carroll
CAV
2009
Springer
181views Hardware» more  CAV 2009»
16 years 1 months ago
Size-Change Termination, Monotonicity Constraints and Ranking Functions
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
Amir M. Ben-Amram
CAV
2009
Springer
184views Hardware» more  CAV 2009»
16 years 1 months ago
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
Vineet Kahlon, Chao Wang, Aarti Gupta
CAV
2009
Springer
177views Hardware» more  CAV 2009»
16 years 1 months ago
Software Transactional Memory on Relaxed Memory Models
Abstract. Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptio...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh