436 search results - page 54 / 88 » A Note on Negligible Functions |
ISBI
2008
IEEE
15 years 10 months ago
2008
IEEE
Visualization and analysis of the micro-architecture of brain parenchyma by means of magnetic resonance imaging is nowadays believed to be one of the most powerful tools used for ...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
SAT
2009
Springer
15 years 4 months ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
COCO
2007
Springer
15 years 4 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In this paper, we propose a new method for learning to rank. `Ranking SVM' is a method for performing the task. It formulizes the problem as that of binary classific...