785 search results - page 78 / 157 » Embedding a Forest in a Graph |
DAC
1998
ACM
14 years 11 months ago
1998
ACM
An embedded system the system continuously interacts with its environment under strict timing constraints, called the external constraints, and it is important to know how these e...
DAC
2003
ACM
14 years 11 months ago
2003
ACM
Many embedded systems use a simple pipelined RISC processor for computation and an on-chip SRAM for data storage. We present an enhancement called Intelligent SRAM (ISRAM) that co...
ICIP
2008
IEEE
14 years 4 months ago
2008
IEEE
—Beyond conventional linear and kernel-based feature extraction, we present a more generalized formulation for feature extraction in this paper. Two representative algorithms usi...
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
The doubling constant of a metric space (X, d) is the smallest value λ such that every ball in X can be covered by λ balls of half the radius. The doubling dimension of X is the...
RSA
2008
13 years 9 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...