900 search results - page 66 / 180 » On Polynomial Time Computation over Unordered Structures |
NCA
2009
IEEE
14 years 3 months ago
2009
IEEE
—Web caching and replication techniques increase accessibility of Web contents and reduce Internet bandwidth requirements. In this paper, we are considering the replica placement...
AGP
1994
IEEE
14 years 1 months ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
ICCV
1998
IEEE
14 years 1 months ago
1998
IEEE
Many applications require detecting structural changes in a scene over a period of time. Comparing intensity values of successive images is not effective as such changes don'...
WSFM
2007
Springer
14 years 3 months ago
2007
Springer
Developing wide-area distributed applications requires jointly analyzing functional and Quality of Service (QoS) aspects, such as timing properties. Labelled transition systems and...
TCOS
2010
13 years 3 months ago
2010
Abstract. In [24] Raddum and Semaev propose a technique to solve systems of polynomial equations over F2 as occurring in algebraic attacks on block ciphers. This approach is known ...