Sciweavers

5316 search results - page 896 / 1064
» Which Search Problems Are Random
Sort
View
GECCO
2008
Springer
117views Optimization» more  GECCO 2008»
15 years 5 months ago
CrossNet: a framework for crossover with network-based chromosomal representations
We propose a new class of crossover operators for genetic algorithms (CrossNet) which use a network-based (or graphbased) chromosomal representation. We designed CrossNet with the...
Forrest Stonedahl, William Rand, Uri Wilensky
BMCBI
2010
198views more  BMCBI 2010»
15 years 4 months ago
ClustalXeed: a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...
Taeho Kim, Hyun Joo
175
Voted
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 4 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
STACS
2007
Springer
15 years 10 months ago
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
Costas Busch, Srikanta Tirthapura
SWAT
2004
Springer
163views Algorithms» more  SWAT 2004»
15 years 9 months ago
New Algorithms for Enumerating All Maximal Cliques
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
Kazuhisa Makino, Takeaki Uno