6274 search results - page 97 / 1255 » From query complexity to computational complexity |
142
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
116
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
156
click to vote
MICCAI
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Cortical surface complexity is a potential structural marker for certain diseases such as schizophrenia. In this study, we developed a measure of fractal dimension (FD) c...
126
click to vote
WDAG
2007
Springer
15 years 10 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
116
click to vote
VTC
2006
IEEE
15 years 9 months ago
2006
IEEE
— The literature of up-link SDMA systems is rich, but at the time of writing there is a paucity of information on the employment of SDMA techniques in the down-link. Hence, in th...