Sciweavers

244 search results - page 27 / 49
» Intervalizing k-Colored Graphs
Sort
View
74
Voted
JGAA
2007
104views more  JGAA 2007»
14 years 9 months ago
Bar k-Visibility Graphs
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
Alice M. Dean, William Evans, Ellen Gethner, Joshu...
103
Voted
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
14 years 9 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
WSC
2007
14 years 12 months ago
Alternative thread scoring methods in qualitative event graphs
Event Graphs (EGs) and Simulation Graph Models provide a powerful and general modeling framework for discrete event simulation. Qualitative Event Graphs (QEGs) extend the EG frame...
Ricki G. Ingalls, Douglas J. Morrice
FGR
2011
IEEE
354views Biometrics» more  FGR 2011»
14 years 1 months ago
Hierarchical ranking of facial attributes
Abstract— We propose a novel hierarchical structured prediction approach for ranking images of faces based on attributes. We view ranking as a bipartite graph matching problem; l...
Ankur Datta, Rogerio Feris, Daniel A. Vaquero
DAC
2011
ACM
13 years 9 months ago
Customer-aware task allocation and scheduling for multi-mode MPSoCs
Today’s multiprocessor system-on-a-chip (MPSoC) products typically have multiple execution modes, and for each mode, all the products utilize the same task allocation and schedu...
Lin Huang, Rong Ye, Qiang Xu