255 search results - page 50 / 51 » Generalized Boosting Algorithms for Convex Optimization |
MM
2006
ACM
13 years 11 months ago
2006
ACM
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
ISCA
2011
IEEE
12 years 9 months ago
2011
IEEE
As we move to large manycores, the hardware-based global checkpointing schemes that have been proposed for small shared-memory machines do not scale. Scalability barriers include ...
ORL
1998
13 years 5 months ago
1998
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
SIGMETRICS
2010
ACM
13 years 6 months ago
2010
ACM
Sharing content over a mobile network through opportunistic contacts has recently received considerable attention. In proposed scenarios, users store content they download in a lo...
ISPD
2000
ACM
13 years 10 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...