457 search results - page 17 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
150
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
162
click to vote
KDID
2004
15 years 7 months ago
2004
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
178
click to vote
TIT
2011
15 years 29 days ago
2011
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
146
click to vote
MFCS
2009
Springer
16 years 17 days ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
151
click to vote
TACAS
2009
Springer
16 years 24 days ago
2009
Springer
The ITPN-PerfBound is a tool for the modeling and analysis of Interval Time Petri Nets (ITPN), that is Petri Nets in which firing time intervals, and possibly firing frequency in...