Sciweavers

75 search results - page 6 / 15
» Using DNA to solve the Bounded Post Correspondence Problem
Sort
View
CIKM
2009
Springer
13 years 12 months ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
14 years 27 days ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 7 months ago
Reversal Complexity Revisited
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
André Hernich, Nicole Schweikardt
FSTTCS
1998
Springer
13 years 11 months ago
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
John H. Reif
SIAMAM
2008
80views more  SIAMAM 2008»
13 years 7 months ago
The Factorization Method for Electrical Impedance Tomography in the Half-Space
We consider the inverse problem of electrical impedance tomography in a conducting half space, given electrostatic measurements on its boundary, i.e., a hyperplane. We first provid...
Martin Hanke, Birgit Schappel