5244 search results - page 209 / 1049 » Structural Complexity of AvgBPP |
139
click to vote
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
136
Voted
ICCSA
2007
Springer
15 years 11 months ago
2007
Springer
Ubiquitous multimedia services are emerging to be available at anytime and anywhere using a variety of computing devices. In this paper, we propose a low-complexity unequal loss pr...
130
click to vote
CAAN
2004
Springer
15 years 10 months ago
2004
Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
146
click to vote
ECCV
2004
Springer
15 years 10 months ago
2004
Springer
Stochastic tracking of structured models in monolithic state spaces often requires modeling complex distributions that are difficult to represent with either parametric or sample...
124
click to vote
ISLPED
2003
ACM
15 years 10 months ago
2003
ACM
Modern superscalar processors implement precise interrupts by using the Reorder Buffer (ROB). In some microarchitectures , such as the Intel P6, the ROB also serves as a repositor...