Sciweavers

643 search results - page 42 / 129
» Merge-Based Computation of Minimal Generators
Sort
View
ICCAD
2001
IEEE
89views Hardware» more  ICCAD 2001»
14 years 5 months ago
Sequential SPFDs
SPFDs are a mechanism to express flexibility in Boolean networks. Introduced by Yamashita et al. in the context of FPGA synthesis [4], they were extended later to general combina...
Subarnarekha Sinha, Andreas Kuehlmann, Robert K. B...
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
14 years 3 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
CVPR
1999
IEEE
14 years 11 months ago
On the Intrinsic Reconstruction of Shape from its Symmetries
The main question we address is: what is the minimal information required to generate closed, non-intersecting planar boundaries? For this paper we restrict ‘shape’ to this mea...
Peter J. Giblin, Benjamin B. Kimia
ICNC
2009
Springer
14 years 3 months ago
Reducing Boarding Time: Synthesis of Improved Genetic Algorithms
—With the aim to minimize boarding time and devise procedures for boarding strategies, this paper develop the synthesis of Improved Genetic Algorithms and simulation. This paper ...
Kang Wang
CSE
2009
IEEE
14 years 27 days ago
Optimization of Component Connections for an Embedded Component System
Software component techniques are widely used to enhance productivity and reduce the cost of software systems development. This paper proposes optimization of component connections...
Takuya Azumi, Hiroaki Takada, Hiroshi Oyama