Sciweavers

2440 search results - page 135 / 488
» Data-Intensive Question Answering
Sort
View
SIGAL
1990
221views Algorithms» more  SIGAL 1990»
14 years 2 months ago
Complexity Cores and Hard Problem Instances
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
Uwe Schöning
FC
2008
Springer
121views Cryptology» more  FC 2008»
13 years 11 months ago
Competition and Fraud in Online Advertising Markets
Abstract. An economic model of the online advertising market is presented, focusing on the effect of ad fraud. In the model, the market is comprised of three classes of players: pu...
Bob Mungamuru, Stephen Weis
CSSW
2007
13 years 11 months ago
Semantic Wikipedia - Checking the Premises
: Enhancing Wikipedia by means of semantic representations seems to be a promising issue. From a formal or technical point of view there are no major obstacles in the way. Neverthe...
Rainer Hammwöhner
TREC
2003
13 years 11 months ago
ITC-irst at TREC 2003: the DIOGENE QA System
This paper describes a new version of the DIOGENE Question Answering (QA) system developed at ITC-Irst. The recent updates here presented are targeted to the participation to TREC...
Milen Kouylekov, Bernardo Magnini, Matteo Negri, H...
ARSCOM
2004
56views more  ARSCOM 2004»
13 years 10 months ago
Some New 4-Designs
The existence question for the family of 4-(15, 5, ) designs has long been answered for all values of except = 2. Here, we resolve this last undecided case and prove that 4-(15, ...
Ziba Eslami, Gholamreza B. Khosrovshahi, M. Mohamm...