Sciweavers

224 search results - page 30 / 45
» The Complexity of Finding Replicas Using Equality Tests
Sort
View
TEC
2002
161views more  TEC 2002»
14 years 9 months ago
A fast and elitist multiobjective genetic algorithm: NSGA-II
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...
Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, T. Mey...
CHI
2005
ACM
15 years 10 months ago
Interaction design for literature-based discovery
Rapid growth in the scientific literature makes it increasingly difficult for scientists to keep abreast of findings outside their own narrowing fields of expertise. To help biome...
Meredith M. Skeels, Kiera Henning, Meliha Yetisgen...
BMCBI
2008
160views more  BMCBI 2008»
14 years 9 months ago
A comparison of four clustering methods for brain expression microarray data
Background: DNA microarrays, which determine the expression levels of tens of thousands of genes from a sample, are an important research tool. However, the volume of data they pr...
Alexander L. Richards, Peter Holmans, Michael C. O...
BMCBI
2010
183views more  BMCBI 2010»
14 years 9 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
81
Voted
ICSE
2009
IEEE-ACM
15 years 10 months ago
Taint-based directed whitebox fuzzing
We present a new automated white box fuzzing technique and a tool, BuzzFuzz, that implements this technique. Unlike standard fuzzing techniques, which randomly change parts of the...
Vijay Ganesh, Tim Leek, Martin C. Rinard