4536 search results - page 575 / 908 » Contention-Sensitive Data Structures and Algorithms |
176
click to vote
IJON
2010
15 years 4 months ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
189
Voted
SIAMSC
2010
15 years 1 months ago
2010
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
210
click to vote
EUROSYS
2011
ACM
14 years 10 months ago
2011
ACM
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
179
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
In this paper, we present a compiler strategy to optimize data accesses in regular array-intensive applications running on embedded multiprocessor environments. Specifically, we p...
175
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...