380 search results - page 42 / 76 » A Categorical Setting for Lower Complexity |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper considers the decomposition of a complex matrix as the product of several sets of semi-unitary matrices and upper triangular matrices in iterative manner. The inner mos...
75
Voted
COCO
2004
Springer
15 years 3 months ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
101
click to vote
JMLR
2011
14 years 4 months ago
2011
While most supervised machine learning models assume that training examples are sampled at random or adversarially, this article is concerned with models of learning from a cooper...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...