150 search results - page 5 / 30 » Counting Results in Weak Formalisms |
DOCENG
2009
ACM
14 years 3 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
ACL
2001
13 years 10 months ago
2001
We consider the question "How much strong generative power can be squeezed out of a formal system without increasing its weak generative power?" and propose some theoret...
ICDCS
2010
IEEE
13 years 9 months ago
2010
IEEE
—In this paper, we classify multitolerant systems, i.e., systems that tolerate multiple classes of faults and provide potentially different levels of tolerance to them in terms o...
ESA
2005
Springer
14 years 2 months ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
ISICT
2003
13 years 10 months ago
2003
: Cryptographic protocols are used to achieve secure communication over insecure networks. Weaknesses in such protocols are hard to identify, as they can be the result of subtle de...