Sciweavers

14518 search results - page 238 / 2904
» Two Problems for Sophistication
Sort
View
110
Voted
FGCN
2007
IEEE
149views Communications» more  FGCN 2007»
15 years 7 months ago
Cover Set Problem in Directional Sensor Networks
— A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover the interested targets...
Yanli Cai, Wei Lou, Minglu Li
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
15 years 7 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia
140
Voted
ICPR
2006
IEEE
15 years 6 months ago
Regularized Locality Preserving Learning of Pre-Image Problem in Kernel Principal Component Analysis
In this paper, we address the pre-image problem in kernel principal component analysis (KPCA). The preimage problem finds a pattern as the pre-image of a feature vector defined in...
Weishi Zheng, Jian-Huang Lai
CEC
2005
IEEE
15 years 6 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...
87
Voted
FCT
2005
Springer
15 years 6 months ago
A New Linearizing Restriction in the Pattern Matching Problem
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
Yo-Sub Han, Derick Wood