Sciweavers

1099 search results - page 194 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
15 years 10 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
RECOMB
2010
Springer
15 years 4 months ago
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
Barna Saha, Allison Hoch, Samir Khuller, Louiqa Ra...
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 3 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
15 years 3 months ago
The second harmonic generation case-study as a gateway for es to quantum control problems
The Second Harmonic Generation (SHG), a process that turns out to be a good test case in the physics lab, can also be considered as a fairly simple theoretical test function for g...
Ofer M. Shir, Thomas Bäck
CASES
2006
ACM
15 years 3 months ago
Methods for power optimization in distributed embedded systems with real-time requirements
Dynamic voltage scaling and sleep state control have been shown to be extremely effective in reducing energy consumption in CMOS circuits. Though plenty of research papers have st...
Razvan Racu, Arne Hamann, Rolf Ernst, Bren Mochock...