3875 search results - page 308 / 775 » Approximation algorithms for the 0-extension problem |
160
click to vote
FOCS
2005
IEEE
16 years 12 days ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
317
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
148
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
144
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
198
click to vote
SIGMOD
2002
ACM
16 years 7 months ago
2002
ACM
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...