Sciweavers

1200 search results - page 15 / 240
» Marked Ancestor Problems
Sort
View
TKDE
2008
153views more  TKDE 2008»
13 years 9 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang
UC
2005
Springer
14 years 3 months ago
Quantum Searching Amidst Uncertainty
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
Lov K. Grover
IJAC
2007
57views more  IJAC 2007»
13 years 9 months ago
Some Group Theory Problems
This is a survey of some problems in geometric group theory which I find interesting. The problems are from different areas of group theory. Each section is devoted to problems ...
Mark V. Sapir
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
14 years 1 months ago
Search--based approaches to the component selection and prioritization problem
This poster paper addresses the problem of choosing sets of software components to combine in component
Mark Harman, Alexandros Skaliotis, Kathleen Steinh...
GEOINFORMATICA
2002
92views more  GEOINFORMATICA 2002»
13 years 9 months ago
Using Genetic Algorithms for Solving Hard Problems in GIS
Genetic algorithms (GAs) are powerful combinatorial optimizers that are able to
Steven van Dijk, Dirk Thierens, Mark de Berg