2430 search results - page 277 / 486 » Computing Tutte Polynomials |
138
click to vote
CONCUR
2000
Springer
15 years 7 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
129
click to vote
SPIN
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
150
click to vote
STACS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
122
click to vote
DAC
1995
ACM
15 years 7 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
109
Voted
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
The paper introduces a framework for clustering data objects in a similarity-based context. The aim is to cluster objects into a given number of classes without imposing a hard pa...