402 search results - page 42 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
ACMMSP
2004
ACM
14 years 1 months ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Many vision problems can be cast as optimizing the conditional probability density function p(C|I) where I is an image and C is a vector of model parameters describing the image. ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
SIGMOD
2010
ACM
14 years 14 days ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color...