1833 search results - page 77 / 367 » A Matrix-Based Approach to the Global Locality Optimization ... |
157
click to vote
HICSS
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
177
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
168
click to vote
INFOCOM
2007
IEEE
16 years 11 days ago
2007
IEEE
Abstract— The Internet connectivity in the Autonomous System (AS) level reflects the commercial relationship between ASes. A connection between two ASes could be of type custome...
152
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
In this paper, we present a new area-based method for visual correspondence search that focuses on the dissimilarity computation. Local and area-based matching methods generally m...
158
click to vote
ECCV
2010
Springer
14 years 9 days ago
2010
Springer
Hough voting methods efficiently handle the high complexity of multiscale,
category-level object detection in cluttered scenes. The primary weakness
of this approach is however t...