29908 search results - page 166 / 5982 » On the Complexity of |
182
click to vote
IEEESCC
2010
IEEE
15 years 10 months ago
2010
IEEE
—As the amount of data generated by today’s pervasive environments increases exponentially, there is a stronger need to decipher the important information that is hidden among ...
166
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and induced by knowledge-changing actions. The mo...
133
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
We introduce two hierarchies of unknown ordinal height. The hierarchies are induced by natural fragments of a calculus based on finite types and G
167
click to vote
LATIN
2000
Springer
15 years 10 months ago
2000
Springer
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
153
click to vote
EUROCOLT
1997
Springer
15 years 10 months ago
1997
Springer
The approach of ordinal mind change complexity, introduced by Freivalds and Smith, uses (notations for) constructive ordinals to bound the number of mind changes made by a learnin...