1157 search results - page 195 / 232 » Descriptive Complexity and Model Checking |
CIIA
2009
14 years 10 months ago
2009
Currently, Web services are available on Internet in a simple and easy way to use. However, a single service can not respond to a predetermined request by user. Thus, it is necessa...
177
Voted
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
177
click to vote
POPL
2005
ACM
15 years 10 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
69
Voted
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
Bounded model checking (BMC) has gained widespread industrial use due to its relative scalability. Its exhaustiveness over all valid input vectors allows it to expose arbitrarily ...
106
click to vote
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
We present algorithms for automatic feature selection for unsupervised structure discovery from video sequences. Feature selection in this scenario is hard because of the absence ...