356 search results - page 1 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
CGO
2003
IEEE
13 years 8 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
COLOGNETWENTE
2010
13 years 3 months ago
2010
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
DAM
2006
13 years 5 months ago
2006
: In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking of multitrees is NP-hard already for m...
JCIT
2007
13 years 5 months ago
2007
Usually, in image processing, edge detectors are mostly used as a basis for high level processing. In many cases, the edge detection gives erroneous and imprecise results, as inco...