877 search results - page 156 / 176 » How to Cover a Grammar |
81
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
93
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
208
Voted
POPL
2008
ACM
16 years 24 days ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
221
Voted
POPL
2003
ACM
16 years 24 days ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
164
click to vote
SIGMOD
2005
ACM
16 years 19 days ago
2005
ACM
A data mining component is included in Microsoft SQL Server 2000 and SQL Server 2005, one of the most popular DBMSs. This gives a push for data mining technologies to move from a ...