4438 search results - page 505 / 888 » Speculative Query Processing |
266
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
MayBMS is a state-of-the-art probabilistic database management system which leverages the strengths of previous database research for achieving scalability. As a proof of concept ...
203
click to vote
ICGI
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
198
click to vote
ICGI
2000
Springer
15 years 10 months ago
2000
Springer
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
195
click to vote
ASWC
2009
Springer
15 years 10 months ago
2009
Springer
Many tasks within semantic web service discovery can be formalized as reasoning problems related to the partial ordering of subactivity occurrences in a complex activity. We show h...
177
Voted
BXML
2003
15 years 8 months ago
2003
Abstract: The goal of information extraction (IE) is to find desired pieces of information in natural language texts and store them in a form that is suitable for automatic queryi...