363 search results - page 61 / 73 » Partial Multicuts in Trees |
GD
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
ARITH
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper presents a 64-bit fixed-point vector multiply-accumulator (MAC) architecture capable of supporting multiple precisions. The vector MAC can perform one 64x64, two 32x32...
WCRE
2003
IEEE
14 years 3 months ago
2003
IEEE
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
CP
2000
Springer
14 years 2 months ago
2000
Springer
Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the proble...
FOCS
1998
IEEE
14 years 2 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...