1133 search results - page 176 / 227 » Basics of Graph Cuts |
CCS
2003
ACM
14 years 2 months ago
2003
ACM
Understanding the strategies of attacks is crucial for security applications such as computer and network forensics, intrusion response, and prevention of future attacks. This pap...
ESWS
2006
Springer
14 years 19 days ago
2006
Springer
A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools...
DLOG
2007
13 years 11 months ago
2007
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w...
FLAIRS
2008
13 years 11 months ago
2008
The problem of recognizing textual entailment (RTE) has been recently addressed using syntactic and lexical models with some success. Here, we further explore this problem, this t...
ALENEX
2004
13 years 10 months ago
2004
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...