Sciweavers

66 search results - page 5 / 14
» Efficient Matrix Chain Ordering in Polylog Time
Sort
View
ALMOB
2006
80views more  ALMOB 2006»
13 years 6 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
ATS
2004
IEEE
87views Hardware» more  ATS 2004»
13 years 10 months ago
Low Power BIST with Smoother and Scan-Chain Reorder
In this paper, we propose a low-power testing methodology for the scan-based BIST. A smoother is included in the test pattern generator (TPG) to reduce average power consumption d...
Nan-Cheng Lai, Sying-Jyan Wang, Yu-Hsuan Fu
EURONGI
2008
Springer
13 years 8 months ago
Secure and Efficient Data Collection in Sensor Networks
Sensor networks are a very specific type of wireless networks where both security and performance issues need to be solved efficiently in order to avoid manipulations of the sensed...
Cristina Cano, Manel Guerrero, Boris Bellalta
LCN
2007
IEEE
14 years 1 months ago
Efficient Multi-Dimensional Flow Correlation
—Flow correlation algorithms compare flows to determine similarity, and are especially useful and well studied for detecting flow chains through “stepping stone” hosts. Most ...
W. Timothy Strayer, Christine E. Jones, Beverly Sc...
QEST
2010
IEEE
13 years 4 months ago
A Phase-Type Representation for the Queue Length Distribution of a Semi-Markovian Queue
Abstract--In this paper we study a broad class of semiMarkovian queues introduced by Sengupta. This class contains many classical queues such as the GI/M/1 queue, SM/MAP/1 queue an...
Benny Van Houdt