2531 search results - page 164 / 507 » Group testing in graphs |
157
click to vote
COCO
2009
Springer
16 years 25 days ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
146
click to vote
ISAAC
2007
Springer
16 years 12 days ago
2007
Springer
We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures...
152
click to vote
WABI
2007
Springer
16 years 11 days ago
2007
Springer
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
160
click to vote
ISMAR
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper we explore the effect of using Augmented Reality for three-dimensional graph link analysis. Two experiments were conducted. The first was designed to compare a tangi...
125
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...