2095 search results - page 145 / 419 » Improved pebbling bounds |
172
click to vote
FOCS
2006
IEEE
16 years 16 days ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
170
click to vote
ORDER
2006
15 years 6 months ago
2006
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...
194
click to vote
RECOMB
2009
Springer
16 years 7 months ago
2009
Springer
The availability of high density single nucleotide polymorphisms (SNPs) data has made genome-wide association study computationally challenging. Twolocus epistasis (gene-gene inter...
174
click to vote
CSFW
2007
IEEE
16 years 24 days ago
2007
IEEE
Randomized protocols for hiding private information can often be regarded as noisy channels in the informationtheoretic sense, and the inference of the concealed information can b...
177
click to vote
RTCSA
2007
IEEE
16 years 22 days ago
2007
IEEE
This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems. The algorithm is based on an unorthodox method called...