Search Sciweavers | Sciweavers

This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...

Leonard Pitt

claim paper

Read More »

136

click to vote

COCO
1989
Springer

113views Algorithms» more COCO 1989»

Boolean Functions, Invariance Groups and Parallel Complexity

15 years 11 months ago

Download clavius.bc.edu

Peter Clote

claim paper

Read More »

149

click to vote

COCO
1990
Springer

84views Algorithms» more COCO 1990»

Some Connections Between Bounded Query Classes and Non-Uniform Complexity

15 years 11 months ago

Download www.cs.umd.edu

Amihood Amir, Richard Beigel, William I. Gasarch

claim paper

Read More »

140

Voted

SIGGRAPH
1992
ACM

124views Computer Graphics» more SIGGRAPH 1992»

Dressing animated synthetic actors with complex deformable clothes

15 years 11 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers