Sciweavers

33 search results - page 3 / 7
» Bipartite Graph Matchings in the Semi-streaming Model
Sort
View
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
13 years 10 months ago
Truthful assignment without money
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
Shaddin Dughmi, Arpita Ghosh
EMNLP
2007
13 years 7 months ago
Using Semantic Roles to Improve Question Answering
Shallow semantic parsing, the automatic identification and labeling of sentential constituents, has recently received much attention. Our work examines whether semantic role info...
Dan Shen, Mirella Lapata
ICDCS
2009
IEEE
14 years 2 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
DAM
2006
116views more  DAM 2006»
13 years 5 months ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
FGR
2011
IEEE
354views Biometrics» more  FGR 2011»
12 years 9 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