Sciweavers

128 search results - page 14 / 26
» Hilbert's Twenty-Fourth Problem
Sort
View
APPML
2008
66views more  APPML 2008»
13 years 8 months ago
On unbounded operators and applications
Assume that Au = f (1) is a solvable linear equation in a Hilbert space H, A is a linear, closed, densely defined, unbounded operator in H, which is not boundedly invertible, so p...
Alexander G. Ramm
NIPS
2008
13 years 10 months ago
Bayesian Network Score Approximation using a Metagraph Kernel
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
Benjamin Yackley, Eduardo Corona, Terran Lane
AMW
2009
13 years 9 months ago
T3: On Mapping Text To Time Series
We investigate if the mapping between text and time series data is feasible such that relevant data mining problems in text can find their counterparts in time series (and vice ver...
Tao Yang, Dongwon Lee
ISBI
2008
IEEE
14 years 3 months ago
Theoretical analysis of complex-conjugate-ambiguity suppression in frequency-domain optical-coherence tomography
New phase-shifting techniques have recently been proposed to suppress the complex-conjugate ambiguity in frequencydomain optical-coherence tomography. A phase shift is introduced,...
S. Chandra Sekhar, Roland Michaely, Rainer A. Leit...
FOSSACS
2005
Springer
14 years 2 months ago
A Simpler Proof Theory for Nominal Logic
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
James Cheney