Sciweavers

5889 search results - page 432 / 1178
» Graph Layout Problems
Sort
View
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
15 years 5 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...
EMNLP
2009
15 years 5 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
GLOBECOM
2009
IEEE
16 years 2 months ago
Multi-Functional Compression with Side Information
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
Soheil Feizi-Khankandi, Muriel Médard
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 11 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
DAC
2003
ACM
16 years 8 months ago
Partial task assignment of task graphs under heterogeneous resource constraints
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
Radoslaw Szymanek, Krzysztof Kuchcinski