Sciweavers

1795 search results - page 162 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
CADE
2007
Springer
14 years 9 months ago
An Incremental Technique for Automata-Based Decision Procedures
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
David Toman, Gulay Ünel
ICMCS
2007
IEEE
124views Multimedia» more  ICMCS 2007»
14 years 3 months ago
Robust Video Object Segmentation Based on K-Means Background Clustering and Watershed in Ill-Conditioned Surveillance Systems
A robust video object segmentation algorithm for complex conditions in surveillance systems is proposed in this paper. This algorithm contains an unsupervised K-Means background c...
Tse-Wei Chen, Shou-Chieh Hsu, Shao-Yi Chien
IEEEARES
2007
IEEE
14 years 3 months ago
Secure, Resilient Computing Clusters: Self-Cleansing Intrusion Tolerance with Hardware Enforced Security (SCIT/HES)
The formidable difficulty in securing systems stems in large part from the increasing complexity of the systems we build but also the degree to which we now depend on information ...
David Arsenault, Arun Sood, Yih Huang
APWEB
2007
Springer
14 years 3 months ago
Untyped XQuery Canonization
XQuery is a powerful language defined by the W3C to query XML documents. Its query functionalities and its expressiveness satisfy the major needs of both the database community an...
Nicolas Travers, Tuyet-Tram Dang-Ngoc, Tianxiao Li...
AOSE
2000
Springer
14 years 1 months ago
Designing Agent-Oriented Systems by Analysing Agent Interactions
We propose a preliminary methodology for agent-oriented software engineering based on the idea of agent interaction analysis. This approach uses interactions between undetermined a...
Simon Miles, Mike Joy, Michael Luck