4313 search results - page 132 / 863 » Using time travel to diagnose computer problems |
166
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
We propose a classification method based on a decision tree whose nodes consist of linear Support Vector Machines (SVMs). Each node defines a decision hyperplane that classifies p...
164
click to vote
SAGT
2010
Springer
15 years 3 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
147
Voted
SIAMNUM
2011
14 years 11 months ago
2011
We derive energy-norm a posteriori error bounds for an Euler timestepping method combined with various spatial discontinuous Galerkin schemes for linear parabolic problems. For acc...
127
click to vote
IVC
2000
15 years 4 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
149
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...