19320 search results - page 365 / 3864 » On the complexity of computing determinants |
181
click to vote
MST
1998
15 years 6 months ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
188
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The Structural SIMilarity Measure (SSIM) combined with the sequential Monte Carlo approach has been shown [1] to achieve more reliable video object tracking performance, compared ...
248
click to vote
STACS
2012
Springer
14 years 2 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
170
click to vote
IV
2009
IEEE
16 years 1 months ago
2009
IEEE
A lexical network is a very useful resource for natural language processing systems. However, building high quality lexical networks is a complex task. “Jeux de mots” is a web...
192
click to vote
AIR
2004
15 years 6 months ago
2004
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...