Sciweavers

597 search results - page 81 / 120
» Homomorphisms of random paths
Sort
View
ACSAC
2003
IEEE
14 years 3 months ago
Automatic Reassembly of Document Fragments via Context Based Statistical Models
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
Kulesh Shanmugasundaram, Nasir D. Memon
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
14 years 2 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...
ITC
1999
IEEE
78views Hardware» more  ITC 1999»
14 years 2 months ago
Minimized power consumption for scan-based BIST
Power consumption of digital systems may increase significantly during testing. In this paper, systems equipped with a scan-based built-in self-test like the STUMPS architecture a...
Stefan Gerstendörfer, Hans-Joachim Wunderlich
VTS
1997
IEEE
86views Hardware» more  VTS 1997»
14 years 2 months ago
Methods to reduce test application time for accumulator-based self-test
Accumulators based on addition or subtraction can be used as test pattern generators. Some circuits, however, require long test lengths if the parameters of the accumulator are no...
Albrecht P. Stroele, Frank Mayer
COMSWARE
2007
IEEE
14 years 1 months ago
An Efficient Scheme for Establishing Pairwise Keys for Wireless Sensor Networks
This paper addresses the problem of secure path key establishment in wireless sensor networks that uses the random key pre-distribution technique. Inspired by the recent proxybased...
Abhishek Gupta, Pavan Nuggehalli, Joy Kuri