13603 search results - page 301 / 2721 » On the Complexity of Computing Treelength |
177
Voted
CONCUR
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...
166
click to vote
ICALP
2007
Springer
16 years 9 days ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
129
click to vote
ICCS
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. Representing concept lattices constructed from large contexts often results in heavy, complex diagrams that can be impractical to handle and, eventually, to make sense of...
175
click to vote
ICIC
2007
Springer
16 years 9 days ago
2007
Springer
: - This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of ...
174
click to vote
ISVC
2007
Springer
16 years 9 days ago
2007
Springer
Surveillance systems that operate continuously generate large volumes of data. One such system is described here, continuously tracking and storing observations taken from multiple...