1480 search results - page 245 / 296 » Distributed algorithms for weighted problems in sparse graph... |
132
click to vote
ICCAD
2006
IEEE
16 years 4 days ago
2006
IEEE
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
139
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
161
Voted
WWW
2005
ACM
16 years 3 months ago
2005
ACM
Automatic extraction of semantic information from text and links in Web pages is key to improving the quality of search results. However, the assessment of automatic semantic meas...
156
Voted
BMCBI
2011
14 years 6 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
111
click to vote
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...