Sciweavers

2780 search results - page 123 / 556
» Generalizing by Removing Detail
Sort
View
RIA
2006
84views more  RIA 2006»
15 years 6 months ago
Learning Recursive Automata from Positive Examples
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
Isabelle Tellier
NFM
2011
303views Formal Methods» more  NFM 2011»
15 years 23 days ago
Instantiation-Based Invariant Discovery
Abstract. We present a general scheme for automated instantiation-based invariant discovery. Given a transition system, the scheme produces k-inductive invariants from templates re...
Temesghen Kahsai, Yeting Ge, Cesare Tinelli
CHI
2006
ACM
16 years 6 months ago
Time is of the essence: an evaluation of temporal compression algorithms
Although speech is a potentially rich information source, a major barrier to exploiting speech archives is the lack of useful tools for efficiently accessing lengthy speech record...
Simon Tucker, Steve Whittaker
POPL
2007
ACM
16 years 6 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might
SIGIR
2009
ACM
16 years 24 days ago
Named entity recognition in query
This paper addresses the problem of Named Entity Recognition in Query (NERQ), which involves detection of the named entity in a given query and classification of the named entity...
Jiafeng Guo, Gu Xu, Xueqi Cheng, Hang Li