1241 search results - page 92 / 249 » Prolog Server Pages |
230
click to vote
POPL
2003
ACM
16 years 4 months ago
2003
ACM
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
141
click to vote
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
140
click to vote
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
138
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
143
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...