Sciweavers

11397 search results - page 96 / 2280
» A Relational Abstraction for Functions
Sort
View
ICDE
2003
IEEE
134views Database» more  ICDE 2003»
14 years 11 months ago
Propagating XML Constraints to Relations
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
Susan B. Davidson, Wenfei Fan, Carmem S. Hara, Jin...
ICA
2004
Springer
14 years 3 months ago
Blind Deconvolution Using the Relative Newton Method
We propose a relative optimization framework for quasi maximum likelihood blind deconvolution and the relative Newton method as its particular instance. Special Hessian structure a...
Alexander M. Bronstein, Michael M. Bronstein, Mich...
STACS
2000
Springer
14 years 1 months ago
Multi-linearity Self-Testing with Relative Error
We investigate self-testing programs with relative error by allowing error terms proportional to the function to be computed. Until now, in numerical computation, error terms were ...
Frédéric Magniez
EACL
2006
ACL Anthology
13 years 11 months ago
Exploiting Shallow Linguistic Information for Relation Extraction from Biomedical Literature
We propose an approach for extracting relations between entities from biomedical literature based solely on shallow linguistic information. We use a combination of kernel function...
Claudio Giuliano, Alberto Lavelli, Lorenza Romano
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 10 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy