369 search results - page 36 / 74 » Accuracy Certificates for Computational Problems with Convex... |
MP
2008
13 years 8 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
CORR
2000
Springer
13 years 8 months ago
2000
Springer
In real-world environments it usually is difficult to specify target operating conditions precisely, for example, target misclassification costs. This uncertainty makes building ro...
SDM
2009
SIAM
14 years 6 months ago
2009
SIAM
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
SIBGRAPI
2008
IEEE
14 years 3 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
BMCBI
2007
13 years 9 months ago
2007
Background: In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular ...