6584 search results - page 155 / 1317 » Distributed Shared Contexts |
119
Voted
COLING
2008
15 years 4 months ago
2008
This paper discusses local alignment kernels in the context of the relation extraction task. We define a local alignment kernel based on the Smith-Waterman measure as a sequence s...
106
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making a...
119
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
As computing systems of all types grow in power and complexity, it is common to want to simultaneously execute processes with different timeliness constraints. Many systems use CP...
109
Voted
HPCA
1999
IEEE
15 years 6 months ago
1999
IEEE
Previous simulators for shared-memory architectures have imposed a large tradeoff between simulation accuracy and speed. Most such simulators model simple processors that do not e...
126
Voted
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
Parallel programming models should attempt to satisfy two conflicting goals. On one hand, they should hide architectural details so that algorithm designers can write simple, port...