450 search results - page 35 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
DAC
1995
ACM
15 years 3 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...
117
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
We present a novel technique for figure-ground segmentation, where the goal is to separate all foreground objects in a test image from the background. We decompose the test image...
143
click to vote
Source Code
The CImg Library is an open source, C++ toolkit for image processing, designed with these properties in mind :
Usefulness
CImg defines classes and methods to manage images in y...
PARELEC
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
102
click to vote
NETWORKS
2011
14 years 6 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...