13603 search results - page 331 / 2721 » On the Computational Complexity of Cut-Reduction |
207
click to vote
IWCMC
2006
ACM
16 years 1 months ago
2006
ACM
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
257
Voted
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We describe a novel and robust feature descriptor called ordinal spatial intensity distribution (OSID) which is invariant to any monotonically increasing brightness changes. Many t...
214
Voted
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
212
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
187
click to vote
LPAR
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...