168 search results - page 15 / 34 » Dynamic Programming Algorithms for Transition-Based Dependen... |
PPOPP
1999
ACM
15 years 2 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
ECSQARU
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...
SCAM
2003
IEEE
15 years 3 months ago
2003
IEEE
Many static analyses aim at assigning to each control point of a program an invariant property that characterizes any state of a trace corresponding to this point. The choice of t...
DMIN
2006
14 years 11 months ago
2006
Clustering is the process of locating patterns in large data sets. It is an active research area that provides value to scientific as well as business applications. Practical clust...
ASPLOS
1994
ACM
15 years 1 months ago
1994
ACM
Synchronization algorithms that are efficient across a wide range of applications and operating conditions are hard to design because their performance depends on unpredictable ru...