514 search results - page 70 / 103 » On the Structure of Valiant's Complexity Classes |
STOC
2004
ACM
14 years 9 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
WABI
2001
Springer
14 years 1 months ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
KR
2000
Springer
14 years 9 days ago
2000
Springer
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
AAAI
1998
13 years 10 months ago
1998
Two of the most important threads of work in knowledge representation today are frame-based representation systems (FRS's) and Bayesian networks (BNs). FRS's provide an ...
ICPR
2002
IEEE
14 years 9 months ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...