Sciweavers

3405 search results - page 107 / 681
» Factoring Groups Efficiently
Sort
View
WIDM
2004
ACM
15 years 12 months ago
Ctree: a compact tree for indexing XML data
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
ISBI
2002
IEEE
16 years 7 months ago
Correction for external LOR effects in listmode reconstruction for PET
In PET imaging listmode is an alternative for projections to store the acquisition data with more accuracy. The reconstruction starting from the listmode format requires different...
Stefaan Vandenberghe, Yves D'Asseler, Rik Van de W...
FCT
2009
Springer
16 years 1 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
DSD
2008
IEEE
115views Hardware» more  DSD 2008»
16 years 26 days ago
An Efficient Multiple-Parity Generator Design for On-Line Testing on FPGA
We propose a method to efficiently design a “parity generator”, which is a stand-alone block producing multiple parity bits of a given circuit. The parity generator is designe...
Petr Fiser, Pavel Kubalík, Hana Kubatova
ATS
2002
IEEE
108views Hardware» more  ATS 2002»
15 years 11 months ago
Fault Set Partition for Efficient Width Compression
In this paper, we present a technique for reducing the test length of counter-based pseudo-exhaustive built-in self-testing (BIST) based on width compression method. More formally...
Emil Gizdarski, Hideo Fujiwara