1092 search results - page 107 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
170
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
Different data acquisition methods are tailored at extracting particular characteristics from a scene and by combining their results a more robust scene description can be created...
149
click to vote
ICC
2007
IEEE
16 years 12 days ago
2007
IEEE
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
188
click to vote
CSL
2007
Springer
16 years 8 days ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
189
Voted
CCECE
2006
IEEE
16 years 4 days ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
157
click to vote
ICDE
2008
IEEE
16 years 16 days ago
2008
IEEE
We formulate three intuitive semantic properties for topk queries in probabilistic databases, and propose GlobalTopk query semantics which satisfies all of them. We provide a dyn...