7006 search results - page 487 / 1402 » Approximation Algorithms |
173
click to vote
IR
2010
15 years 4 months ago
2010
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
151
Voted
CSE
2008
IEEE
15 years 6 months ago
2008
IEEE
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n
177
click to vote
IEEECIT
2009
IEEE
16 years 29 days ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
160
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
136
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...