40 search results - page 8 / 8 » Approximating Weighted Max-SAT Problems by Compensating for ... |
WSCG
2004
13 years 6 months ago
2004
The problem of segmenting color video sequences is addressed. Boundary motion and occlusion relations expressed by labeling rules are argued to be of key importance for segmentati...
IJCV
2007
13 years 5 months ago
2007
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
SIGECOM
2010
ACM
13 years 10 months ago
2010
ACM
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...
KDD
2004
ACM
14 years 5 months ago
2004
ACM
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...
NIPS
2004
13 years 6 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...