6740 search results - page 1125 / 1348 » An s -Hamiltonian Line Graph Problem |
260
click to vote
ISCA
2012
IEEE
13 years 7 months ago
2012
IEEE
Most modern cores perform a highly-associative translation look aside buffer (TLB) lookup on every memory access. These designs often hide the TLB lookup latency by overlapping it...
158
Voted
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
148
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
126
Voted
PODC
2009
ACM
16 years 5 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
133
click to vote
RECOMB
2005
Springer
16 years 5 months ago
2005
Springer
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...