Sciweavers

1260 search results - page 79 / 252
» Bipolar Preference Problems
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 8 months ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...
EVOW
2001
Springer
14 years 2 months ago
A Constructive Evolutionary Approach to School Timetabling
This work presents a constructive approach to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constrain...
Geraldo Ribeiro Filho, Luiz Antonio Nogueira Loren...
3DUI
2011
75views more  3DUI 2011»
12 years 10 months ago
Dropping the ball: Releasing a virtual grasp
We present a method for improved release of whole-hand virtual grasps. It addresses the problem of objects “sticking” during release after the user’s (real) fingers interpen...
Mores Prachyabrued, Christoph W. Borst
CVPR
2012
IEEE
12 years 13 days ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould
JMLR
2006
125views more  JMLR 2006»
13 years 10 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer