|
Volumn 3120, Issue , 2004, Pages 210-223
|
Learning a hidden graph using O(log n) queries per edge
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTER SCIENCE;
GRAPH THEORY;
LEARNING SYSTEMS;
PROBABILITY;
PROBLEM SOLVING;
QUERY LANGUAGES;
C (PROGRAMMING LANGUAGE);
LEARNING ALGORITHMS;
EDGE DETECTING QUERY LANGUAGES;
HIDDEN GRAPHS;
LAS VEGAS ALGORITHMS;
SEQUENCING;
ADAPTIVE MONTE CARLO ALGORITHMS;
BOUNDED DEGREE;
CONSTANT FACTORS;
DETERMINISTIC ALGORITHMS;
EDGE-DETECTING QUERIES;
GENOME SEQUENCING;
R-UNIFORM HYPERGRAPHS;
EDGE DETECTION;
GRAPH THEORY;
|
EID: 9444267793
PISSN: 03029743
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1007/978-3-540-27819-1_15 Document Type: Conference Paper |
Times cited : (19)
|
References (6)
|