420 search results - page 82 / 84 » Some Algorithmic Problems in Polytope Theory |
145
click to vote
TOMACS
2011
14 years 4 months ago
2011
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
TMC
2010
14 years 4 months ago
2010
Although the EDCA access mechanism of the 802.11e standard supports legacy DCF stations, the presence of DCF stations in the WLAN jeopardizes the provisioning of the service guaran...
81
Voted
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
CLEF
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents the LIG contribution to the CLEF 2007 medical retrieval task (i.e. ImageCLEFmed). The main idea in this paper is to incorporate medical knowledge in the langua...