Sciweavers

80 search results - page 1 / 16
» Finding Cores of Limited Length
Sort
View
WADS
1997
Springer
88views Algorithms» more  WADS 1997»
13 years 9 months ago
Finding Cores of Limited Length
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlu...
QUESTA
2006
87views more  QUESTA 2006»
13 years 4 months ago
Some universal limits for nonhomogeneous birth and death processes
In this paper we consider nonhomogeneous birth and death processes (BDP) with periodic rates. Two important parameters are studied, which are helpful to describe a nonhomogeneous B...
Alexander I. Zeifman, S. Leorato, E. Orsingher, Ya...
OOPSLA
2005
Springer
13 years 10 months ago
Inferring context-free grammars for domain-specific languages
Grammatical inference (or grammar inference) has been applied to various problems in areas such as computational biology, and speech and pattern recognition but its application to...
Faizan Javed
DSD
2009
IEEE
85views Hardware» more  DSD 2009»
13 years 11 months ago
Thermal-Aware Test Scheduling for Core-Based SoC in an Abort-on-First-Fail Test Environment
—Long test application time and high temperature have become two major issues of system-on-chip (SoC) test. In order to minimize test application times and avoid overheating duri...
Zhiyuan He, Zebo Peng, Petru Eles
ISCI
2008
116views more  ISCI 2008»
13 years 4 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu