356 search results - page 27 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
113
Voted
ICIP
2008
IEEE
15 years 6 months ago
2008
IEEE
Conventional electrophotographic printers tend to produce Moir´e artifacts when used for printing images scanned from printed material such as books and magazines. We propose a n...
116
Voted
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
102
Voted
JCT
2007
15 years 8 days ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
116
click to vote
WINE
2005
Springer
15 years 5 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
121
click to vote
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
Foreground segmentation is one of the most challenging problems in computer vision. In this paper, we propose a new algorithm for static camera foreground segmentation. It combine...