1452 search results - page 165 / 291 » Algorithmic Analysis of Array-Accessing Programs |
106
click to vote
PLDI
2004
ACM
15 years 6 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
142
click to vote
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
94
Voted
ICFEM
2000
Springer
15 years 4 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
109
click to vote
BMCBI
2005
15 years 16 days ago
2005
Background: Many cutting-edge microarray analysis tools and algorithms, including commonly used limma and affy packages in Bioconductor, need sophisticated knowledge of mathematic...
158
Voted
POPL
1994
ACM
15 years 4 months ago
1994
ACM
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...