7930 search results - page 563 / 1586 » Greedy in Approximation Algorithms |
189
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...
186
click to vote
VLDB
2004
ACM
16 years 13 days ago
2004
ACM
Histograms and Wavelet synopses provide useful tools in query optimization and approximate query answering. Traditional histogram construction algorithms, such as V-Optimal, optim...
173
click to vote
ICAIL
2003
ACM
16 years 11 days ago
2003
ACM
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...
229
click to vote
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
217
click to vote
TSP
2008
15 years 7 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...