3208 search results - page 225 / 642 » A Lower Bound for Primality |
204
click to vote
ANSS
1991
IEEE
15 years 10 months ago
1991
IEEE
The notions of the critical path of events and critical time of an event are key concepts in analyzing the performance of a parallel discrete event simulation. The highest critica...
226
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....
208
click to vote
SOFSEM
2012
Springer
14 years 2 months ago
2012
Springer
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...
236
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
We consider the problem of shape recovery for real world scenes, where a variety of global illumination (interreflections, subsurface scattering, etc.) and illumination defocus e...
187
click to vote
AAAI
2012
13 years 9 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...