Sciweavers

2412 search results - page 223 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
TREC
2003
15 years 5 months ago
Passage Scoring for Question Answering via Bayesian Inference on Lexical Relations
Many researchers have used lexical networks and ontologies to mitigate synonymy and polysemy problems in Question Answering (QA), systems coupled with taggers, query classifiers,...
Deepa Paranjpe, Ganesh Ramakrishnan, Sumana Sriniv...
ECBS
1999
IEEE
138views Hardware» more  ECBS 1999»
15 years 8 months ago
Multi-Domain Surety Modeling and Analysis for High Assurance Systems
Engineering systems are becoming increasingly complex as state of the art technologies are incorporated into designs. Surety modeling and analysis is an emerging science which per...
James Davis, Jason Scott, Janos Sztipanovits, Marc...
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
16 years 5 months ago
ViteX: A Streaming XPath Processing System
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
Yi Chen, Susan B. Davidson, Yifeng Zheng
ICDT
1995
ACM
96views Database» more  ICDT 1995»
15 years 7 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong
ATAL
2010
Springer
15 years 5 months ago
Decision making with dynamically arriving information
Decision making is the ability to decide on the best alternative among a set of candidates based on their value. In many real-world domains the value depends on events that occur ...
Meir Kalech, Avi Pfeffer