194 search results - page 35 / 39 » Computing Roundness is Easy if the Set is Almost Round |
111
Voted
BMCBI
2006
15 years 16 days ago
2006
Background: We have recently introduced a predictive framework for studying gene transcriptional regulation in simpler organisms using a novel supervised learning algorithm called...
140
Voted
AAAI
2012
13 years 2 months ago
2012
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
113
click to vote
ACMSE
2004
ACM
15 years 6 months ago
2004
ACM
Replacement policy, one of the key factors determining the effectiveness of a cache, becomes even more important with latest technological trends toward highly associative caches....
100
Voted
PPOPP
2009
ACM
16 years 1 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...