Sciweavers

3897 search results - page 121 / 780
» complexity 2010
Sort
View
INLG
2010
Springer
13 years 8 months ago
Using Semantic Web Technology to Support NLG. Case Study: OWL finds RAGS
The semantic web is a general vision for supporting knowledge-based processing across the WWW and its successors. As such, semantic web technology has potential to support the exc...
Chris Mellish
APPML
2010
133views more  APPML 2010»
13 years 10 months ago
Fractional relaxation equations on Banach spaces
Abstract. We study existence and qualitative properties of solutions for the abstract fractional relaxation equation (0.1) u (t) - AD t u(t) + u(t) = f(t), 0 < < 1, t 0, u(...
Carlos Lizama, Humberto Prado
JMLR
2010
109views more  JMLR 2010»
13 years 5 months ago
Matrix Completion from Noisy Entries
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
MST
2010
117views more  MST 2010»
13 years 5 months ago
The 1-Versus-2 Queries Problem Revisited
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
Rahul Tripathi
JLP
2010
96views more  JLP 2010»
13 years 8 months ago
Implicit characterizations of FPTIME and NC revisited
Various simplified or improved, and partly corrected well-known implicit characterizations of the complexity classes FPTIME and NC are presented. Primarily, the interest is in si...
Karl-Heinz Niggl, Henning Wunderlich