Sciweavers

691 search results - page 63 / 139
» Non-negative graph embedding
Sort
View
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
13 years 2 months ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
Timothy M. Chan
DAC
1998
ACM
14 years 9 months ago
Rate Derivation and Its Applications to Reactive, Real-Time Embedded Systems
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...
Ali Dasdan, Dinesh Ramanathan, Rajesh K. Gupta
DAC
2003
ACM
14 years 9 months ago
Embedded intelligent SRAM
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...
Prabhat Jain, G. Edward Suh, Srinivas Devadas
ICIP
2008
IEEE
14 years 2 months ago
Correlation Embedding Analysis
—Beyond conventional linear and kernel-based feature extraction, we present a more generalized formulation for feature extraction in this paper. Two representative algorithms usi...
Yun Fu, Thomas S. Huang
FOCS
2003
IEEE
14 years 1 months ago
Bounded Geometries, Fractals, and Low-Distortion Embeddings
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...
Anupam Gupta, Robert Krauthgamer, James R. Lee