Sciweavers

2286 search results - page 117 / 458
» Algorithms for Categorical Equivalence
Sort
View
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
15 years 3 months ago
Optimal Integer Alphabetic Trees in Linear Time
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
T. C. Hu, Lawrence L. Larmore, J. David Morgenthal...
FIMI
2003
104views Data Mining» more  FIMI 2003»
14 years 11 months ago
AIM: Another Itemset Miner
We present a new algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the efficiency of the mining task. We integrate...
Amos Fiat, Sagi Shporer
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
15 years 4 months ago
Approximating Transitive Reductions for Directed Networks
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
ISCAS
2006
IEEE
105views Hardware» more  ISCAS 2006»
15 years 4 months ago
A new Spice-oriented frequency-domain optimization technique
— There are many kinds of optimization techniques for designing high-performance RF circuits. In this paper, we propose a new frequency-domain Spice-oriented optimization algorit...
Masayoshi Oda, Yoshihiro Yamagami, Yoshifumi Nishi...
ISSADS
2005
Springer
15 years 3 months ago
Model Fragmentation for Distributed Workflow Execution: A Petri Net Approach
Workflow is the key technology for business process automation, while distributed workflow is the solution to deal with the decentralized nature of workflow applications and the pe...
Wei Tan, Yushun Fan