4110 search results - page 160 / 822 » Efficient algorithms for the 2-gathering problem |
161
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
138
click to vote
EOR
2010
15 years 4 months ago
2010
We consider the problem of accurately measuring the credit risk of a portfolio consisting of loans, bonds and other financial assets. One particular performance measure of interes...
134
click to vote
SAC
2008
ACM
15 years 4 months ago
2008
ACM
Ontology learning integrates many complementary techniques, including machine learning, natural language processing, and data mining. Specifically, clustering techniques facilitat...
130
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
113
click to vote
ICALP
1993
Springer
15 years 8 months ago
1993
Springer
Broadcasting concerns transmitting information from a node of a communication network to all other nodes. We consider this problem assuming that links and nodes of the network fail...