321 search results - page 10 / 65 » Partitioning by iterative deletion |
ISCAS
2005
IEEE
14 years 3 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
JDA
2008
13 years 10 months ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
ICDAR
2003
IEEE
14 years 3 months ago
2003
IEEE
Existing skeletonization methods operate directly on the binary image ignoring the gray-level information. In this paper we propose a new method for the skeletonization of handwri...
CODES
2005
IEEE
14 years 3 months ago
2005
IEEE
Nested loops are the most critical sections in many scientific and Digital Signal Processing (DSP) applications. It is important to study effective and efficient transformation ...
HPDC
2011
IEEE
13 years 1 months ago
2011
IEEE
In today’s high performance computing practice, fail-stop failures are often tolerated by checkpointing. While checkpointing is a very general technique and can often be applied...