Sciweavers

518 search results - page 85 / 104
» Beating a Random Assignment
Sort
View
JDA
2010
88views more  JDA 2010»
15 years 26 days ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...
NETWORKS
2010
15 years 25 days ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
ICCAD
2009
IEEE
119views Hardware» more  ICCAD 2009»
15 years 5 days ago
Iterative layering: Optimizing arithmetic circuits by structuring the information flow
Current logic synthesis techniques are ineffective for arithmetic circuits. They perform poorly for XOR-dominated circuits, and those with a high fan-in dependency between inputs ...
Ajay K. Verma, Philip Brisk, Paolo Ienne
117
Voted
CVPR
2008
IEEE
16 years 4 months ago
Estimating age, gender, and identity using first name priors
Recognizing people in images is one of the foremost challenges in computer vision. It is important to remember that consumer photography has a highly social aspect. The photograph...
Andrew C. Gallagher, Tsuhan Chen
CVPR
2011
IEEE
14 years 10 months ago
Learning to Find Occlusion Regions
For two consecutive frames in a video, we identify which pixels in the first frame become occluded in the second. Such general-purpose detection of occlusion regions is difficul...
Ahmad Humayun, Oisin Mac Aodha, Gabriel Brostow