1833 search results - page 77 / 367 » A Matrix-Based Approach to the Global Locality Optimization ... |
131
Voted
HICSS
2005
IEEE
15 years 9 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...
146
Voted
PPSN
2010
Springer
15 years 1 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 ...
135
click to vote
INFOCOM
2007
IEEE
15 years 9 months 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...
122
Voted
CVPR
2005
IEEE
16 years 5 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...
125
click to vote
ECCV
2010
Springer
13 years 9 months 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...