Sciweavers

4131 search results - page 34 / 827
» Compactness in Topology and Computation
Sort
View
CSDA
2007
115views more  CSDA 2007»
15 years 1 months ago
Algorithms for compact letter displays: Comparison and evaluation
Multiple pairwise comparisons are one of the most frequent tasks in applied statistics. In this context, letter displays may be used for a compact presentation of results of multi...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
DAC
1997
ACM
15 years 6 months ago
Hierarchical Sequence Compaction for Power Estimation
- This paper presents an effective technique for compacting a large sequence of input vectors into a much smaller one such that when the two sequences are applied to any circuit, t...
Radu Marculescu, Diana Marculescu, Massoud Pedram
DAC
1996
ACM
15 years 6 months ago
Improving the Efficiency of Power Simulators by Input Vector Compaction
Accurate power estimation is essential for low power digital CMOS circuit design. Power dissipation is input pattern dependent. To obtain an accurate power estimate, a large input...
Chi-Ying Tsui, Radu Marculescu, Diana Marculescu, ...
ICCV
2009
IEEE
16 years 6 months ago
Compact Signatures for High-Speed Interest Point Description and Matching
Prominent feature point descriptors such as SIFT and SURF allow reliable real-time matching but at a compu- tational cost that limits the number of points that can be handled on...
Michael Calonder, Vincent Lepetit, Pascal Fua, Kur...
PODC
2003
ACM
15 years 7 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing