7055 search results - page 203 / 1411 » Some New 4-Designs |
195
click to vote
ICSM
2002
IEEE
15 years 11 months ago
2002
IEEE
Data manipulation, or algorithmic complexity, is not taken into account adequately in any of the most popular functional size measurement methods. In this paper, we recall some we...
167
click to vote
BIBE
2004
IEEE
15 years 10 months ago
2004
IEEE
In microarray gene expression data, clusters may hide in subspaces. Traditional clustering algorithms that make use of similarity measurements in the full input space may fail to ...
174
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
207
click to vote
EWSA
2006
Springer
15 years 10 months ago
2006
Springer
Software architectures are often designed with respect to some architecture patterns, like the pipeline and peer-to-peer. These patterns are the guarantee of some quality attribute...
191
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. There are evolutionary trajectories in two different but related spaces, design space and niche space. Coevolution occurs in parallel trajectories in both spaces, with co...