1789 search results - page 285 / 358 » Genetic Algorithms for Component Analysis |
150
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
101
Voted
DAC
2003
ACM
16 years 4 months ago
2003
ACM
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
185
Voted
Publication
For quantitative analysis of histopathological images,
such as the lymphoma grading systems, quantification of
features is usually carried out on single cells before categorizing...
121
click to vote
ASPLOS
2000
ACM
15 years 7 months ago
2000
ACM
The emergence of the Internet as a trusted medium for commerce and communication has made cryptography an essential component of modern information systems. Cryptography provides ...
145
Voted
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
In the past decade or so, subspace methods have been largely used in face recognition ? generally with quite success. Subspace approaches, however, generally assume the training d...