Sciweavers

982 search results - page 119 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
105
Voted
UAI
2003
15 years 2 months ago
Layerwidth: Analysis of a New Metric for Directed Acyclic Graphs
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...
Mark Hopkins
122
Voted
ICCAD
2007
IEEE
281views Hardware» more  ICCAD 2007»
15 years 9 months ago
Archer: a history-driven global routing algorithm
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
Muhammet Mustafa Ozdal, Martin D. F. Wong
EMNLP
2009
14 years 10 months ago
Graph Alignment for Semi-Supervised Semantic Role Labeling
Unknown lexical items present a major obstacle to the development of broadcoverage semantic role labeling systems. We address this problem with a semisupervised learning approach ...
Hagen Fürstenau, Mirella Lapata
120
Voted
TWC
2010
14 years 7 months ago
Lifetime-resource tradeoff for multicast traffic in wireless sensor networks
In this paper, we study the problem of supporting multicast traffic in wireless sensor networks with network coding. On one hand, coding operations can reduce power consumption and...
Vahid Shah-Mansouri, Vincent W. S. Wong
IPPS
2006
IEEE
15 years 6 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch