Sciweavers

9871 search results - page 5 / 1975
» On the Structure of Low Sets
Sort
View
ICDT
2010
ACM
137views Database» more  ICDT 2010»
13 years 6 months ago
A Greedy Algorithm for Constructing a Low-Width Generalized Hypertree Decomposition
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
Kaoru Katayama, Tatsuro Okawara, Yuka Itou
ETS
2009
IEEE
79views Hardware» more  ETS 2009»
13 years 5 months ago
Concurrent Self-Test with Partially Specified Patterns for Low Test Latency and Overhead
Structural on-line self-test may be performed to detect permanent faults and avoid their accumulation. This paper improves concurrent BIST techniques based on a deterministic test ...
Michael A. Kochte, Christian G. Zoellin, Hans-Joac...
ICML
2010
IEEE
13 years 8 months ago
Robust Subspace Segmentation by Low-Rank Representation
We propose low-rank representation (LRR) to segment data drawn from a union of multiple linear (or affine) subspaces. Given a set of data vectors, LRR seeks the lowestrank represe...
Guangcan Liu, Zhouchen Lin, Yong Yu
ECAL
2003
Springer
14 years 25 days ago
Low-Level Visual Homing
Abstract. We present a variant of the snapshot model [1] for insect visual homing. In this model a snapshot image is taken by an agent at the goal position. The disparity between c...
Andrew Vardy, Franz Oppacher
MICRO
1994
IEEE
99views Hardware» more  MICRO 1994»
13 years 11 months ago
Data relocation and prefetching for programs with large data sets
Numerical applications frequently contain nested loop structures that process large arrays of data. The execution of these loop structures often produces memory preference pattern...
Yoji Yamada, John Gyllenhall, Grant Haab, Wen-mei ...