Sciweavers

3368 search results - page 589 / 674
» The Complexity of Query Reliability
Sort
View
SIAMCOMP
2010
88views more  SIAMCOMP 2010»
13 years 4 months ago
Hardness Amplification Proofs Require Majority
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
Ronen Shaltiel, Emanuele Viola
ICASSP
2011
IEEE
13 years 1 months ago
Sentence simplification for spoken language understanding
In this paper, we present a sentence simplification method and demonstrate its use to improve intent determination and slot filling tasks in spoken language understanding (SLU) ...
Gökhan Tür, Dilek Hakkani-Tür, Larr...
NAR
2011
158views Computer Vision» more  NAR 2011»
13 years 27 days ago
T1DBase: update 2011, organization and presentation of large-scale data sets for type 1 diabetes research
T1DBase (http://www.t1dbase.org) is web platform, which supports the type 1 diabetes (T1D) community. It integrates genetic, genomic and expression data relevant to T1D research a...
Oliver S. Burren, Ellen C. Adlem, Premanand Achuth...
AAAI
2011
12 years 10 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
ICDAR
2011
IEEE
12 years 9 months ago
BLSTM Neural Network Based Word Retrieval for Hindi Documents
—Retrieval from Hindi document image collections is a challenging task. This is partly due to the complexity of the script, which has more than 800 unique ligatures. In addition,...
Raman Jain, Volkmar Frinken, C. V. Jawahar, Raghav...