Sciweavers

3359 search results - page 103 / 672
» A Simplified Idea Algorithm
Sort
View
DCC
2007
IEEE
16 years 2 months ago
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, ...
104
Voted
ACCV
2009
Springer
15 years 9 months ago
Levels of Details for Gaussian Mixture Models
Mixtures of Gaussians are a crucial statistical modeling tool at the heart of many challenging applications in computer vision and machine learning. In this paper, we first descri...
Vincent Garcia, Frank Nielsen, Richard Nock
CEC
2005
IEEE
15 years 8 months ago
Linear equality constraints and homomorphous mappings in PSO
We present a homomorphous mapping that converts problems with linear equality constraints into fully unconstrained and lower-dimensional problems for optimization with PSO. This ap...
Christopher K. Monson, Kevin D. Seppi
DAC
1999
ACM
15 years 6 months ago
Buffer Insertion with Accurate Gate and Interconnect Delay Computation
Buffer insertion has become a critical step in deep submicron design, and several buffer insertion/sizing algorithms have been proposed in the literature. However, most of these m...
Charles J. Alpert, Anirudh Devgan, Stephen T. Quay
COCOON
1997
Springer
15 years 6 months ago
Edge and Node Searching Problems on Trees
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming...