1162 search results - page 185 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
JSSPP
2009
Springer
14 years 2 months ago
2009
Springer
The number of applications with many parallel cooperating processes is steadily increasing, and developing efficient runtimes for their execution is an important task. Several fram...
GLVLSI
2006
IEEE
14 years 2 months ago
2006
IEEE
In modern IC design, the number of long on-chip wires has been growing rapidly because of the increasing circuit complexity. Interconnect delay has dominated over gate delay as te...
SMI
2006
IEEE
14 years 2 months ago
2006
IEEE
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
ICDCSW
2005
IEEE
14 years 1 months ago
2005
IEEE
Today’s multimedia environments are characterized by different stationary and a growing number of mobile devices, like PDAs or even mobile phones. To meet their requirements reg...
SBACPAD
2003
IEEE
14 years 1 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...