70 search results - page 2 / 14 » Relating Yield Models to Burn-In Fall-Out in Time |
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
A defining characteristic of continuous queries over on-line data streams, possibly bounded by sliding windows, is the potentially infinite and time-evolving nature of their input...
ICST
2009
IEEE
13 years 5 months ago
2009
IEEE
This paper studies the problem of model-based testing of real-time systems that are only partially observable. We model the System Under Test (SUT) using Timed Game Automata (TGA)...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
ACL
2011
12 years 11 months ago
2011
Information extraction (IE) holds the promise of generating a large-scale knowledge base from the Web’s natural language text. Knowledge-based weak supervision, using structured...