3820 search results - page 81 / 764 » Bounded Model Debugging |
133
click to vote
COCO
2007
Springer
15 years 8 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
138
click to vote
MMB
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
TALG
2010
15 years 17 days ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
145
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
127
click to vote
RTSS
2007
IEEE
15 years 8 months ago
2007
IEEE
Schedulability analysis is a cornerstone of modern real-time scheduling theory development. Utilizationbound based schedulability test is considered one of most efficient and effe...