Sciweavers

575 search results - page 36 / 115
» Wichita State University
Sort
View
ICML
1999
IEEE
14 years 8 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
SAS
2009
Springer
204views Formal Methods» more  SAS 2009»
14 years 8 months ago
Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology
parsing: static analysis of dynamically generated string output using LR-parsing technology Kyung-Goo Doh1 , Hyunha Kim1 , David A. Schmidt2 1 Hanyang University, Ansan, South Kore...
Kyung-Goo Doh, Hyunha Kim, David A. Schmidt
SIGMOD
2005
ACM
113views Database» more  SIGMOD 2005»
14 years 8 months ago
From databases to dataspaces: a new abstraction for information management
straction for Information Management Michael Franklin University of California, Berkeley Alon Halevy Google Inc. and U. Washington David Maier Portland State University The develo...
Michael J. Franklin, Alon Y. Halevy, David Maier
ICPR
2010
IEEE
14 years 2 months ago
Continuous Markov Random Field Optimization using Fusion Move Driven Markov Chain Monte Carlo Technique
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
Wonsik Kim (Seoul National University), Kyoung Mu ...
SIGCSE
2010
ACM
175views Education» more  SIGCSE 2010»
14 years 2 months ago
Compatibility of partnered students in computer science education
This paper details the results of an investigation into the compatibility of partnered computer science students. The study involved approximately 290 students at the University o...
Joshua Sennett, Mark Sherriff