Sciweavers

773 search results - page 6 / 155
» Traversing the Machining Graph
Sort
View
BCB
2010
156views Bioinformatics» more  BCB 2010»
13 years 4 months ago
RepFrag: a graph based method for finding repeats and transposons from fragmented genomes
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
Nirmalya Bandyopadhyay, A. Mark Settles, Tamer Kah...
ML
2000
ACM
150views Machine Learning» more  ML 2000»
13 years 9 months ago
Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
Filippo Menczer, Richard K. Belew
ICML
1998
IEEE
14 years 10 months ago
Structural Machine Learning with Galois Lattice and Graphs
Michel Liquiere, Jean Sallantin
COLT
1995
Springer
14 years 1 months ago
Exactly Learning Automata with Small Cover Time
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
Dana Ron, Ronitt Rubinfeld
TACAS
2005
Springer
115views Algorithms» more  TACAS 2005»
14 years 3 months ago
On-the-Fly Reachability and Cycle Detection for Recursive State Machines
Searching the state space of a system using enumerative and on-the-fly depth-first traversal is an established technique for model checking finite-state systems. In this paper, ...
Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, P....