In this paper we introduce a new graph based bidding language for combinatorial auctions. In our language, each bidder submits to the arbitrator a generalized flow network (netbid...
Madalina Croitoru, Cornelius Croitoru, Paul H. Lew...
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
Shallow semantic parsing, the automatic identification and labeling of sentential constituents, has recently received much attention. Our work examines whether semantic role info...
Learning from ambiguous training data is highly relevant in many applications. We present a new learning algorithm for classification problems where labels are associated with se...
Abstract. Consider scenes deteriorated by reflections off a semireflecting medium (e.g., a glass window) that lies between the observer and an object. We present two approaches to ...