2412 search results - page 48 / 483 » Which Problems Have Strongly Exponential Complexity |
IJCAI
1997
15 years 2 months ago
1997
This paper presents an algorithm for extract ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
107
Voted
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
TIT
1998
15 years 8 days ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
102
Voted
MOBIHOC
2009
ACM
16 years 1 months ago
2009
ACM
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
110
Voted
CORR
2010
Springer
15 years 22 days ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...