3913 search results - page 426 / 783 » complexity 2006 |
193
click to vote
COMPUTING
2006
15 years 6 months ago
2006
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...
138
Voted
COR
2006
15 years 6 months ago
2006
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...
161
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type...
149
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
This letter derives the asymptotic symbol error rate (SER) and outage probability of multiple-input multiple-output (MIMO) maximum ratio-combining (MRC) systems. We consider Raylei...
173
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...