483 search results - page 43 / 97 » On perfectness of sums of graphs |
94
Voted
CVPR
2007
IEEE
16 years 29 days ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
80
Voted
ICC
2007
IEEE
15 years 5 months ago
2007
IEEE
—We consider the adaptive throughput optimization problem for multiple-input multiple-output (MIMO) systems in Rayleigh fading channels. With perfect channel knowledge at the tra...
81
Voted
CPAIOR
2007
Springer
15 years 5 months ago
2007
Springer
This paper introduces DEVIATION, a soft global constraint to obtain balanced solutions. A violation measure of the perfect balance can be defined as the Lp norm of the vector vari...
92
Voted
TIT
2008
14 years 10 months ago
2008
We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the mediu...
116
Voted
SUM
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. An ontology matching method (or a matcher) aims at matching every entity (or concept) in one ontology to the most suitable entity (or entities) in another ontology. Usual...