1538 search results - page 131 / 308 » Spectral Techniques in Graph Algorithms |
129
click to vote
APDC
1997
15 years 2 months ago
1997
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...
RECOMB
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. The interpretation of large-scale protein network data depends on our ability to identify significant sub-structures in the data, a computationally intensive task. Here w...
115
click to vote
ICRA
2006
IEEE
15 years 7 months ago
2006
IEEE
— When a network of robots or static sensors is emplaced in an environment, the spatial relationships between the sensing units must be inferred or computed for most key applicat...
MST
2010
14 years 12 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
116
click to vote
PLDI
2003
ACM
15 years 6 months ago
2003
ACM
Clustered architectures are a solution to the bottleneck of centralized register files in superscalar and VLIW processors. The main challenge associated with clustered architectu...