489 search results - page 97 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
ECCC
2007
13 years 7 months ago
2007
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
SIGIR
1997
ACM
13 years 11 months ago
1997
ACM
Word usage is domain dependent. A common word in one domain can be quite infrequent in another. In this study we exploit this property of word usage to improve document routing. W...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
SIGMOD
2010
ACM
14 years 9 days ago
2010
ACM
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
WIOPT
2010
IEEE
13 years 5 months ago
2010
IEEE
We consider the problem of providing opportunistic spectrum access to secondary users in wireless cellular networks. From the standpoint of spectrum license holders, achieving ben...