1525 search results - page 125 / 305 » Matching with Regular Constraints |
245
click to vote
TON
2010
14 years 10 months ago
2010
We consider a class of wireless networks with general interference constraints on the set of links that can be served simultaneously at any given time. We restrict the traffic to b...
167
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...
116
click to vote
ICCV
2005
IEEE
16 years 6 months ago
2005
IEEE
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
143
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
132
click to vote
MICCAI
2009
Springer
2009
Springer
DISCO: A Coherent Diffeomorphic Framework for Brain Registration under Exhaustive Sulcal Constraints
16 years 1 months ago
Abstract. Neuroimaging at the group level requires spatial normalization of individual structural data. We propose a geometric approach that consists in matching a series of cortic...