986 search results - page 131 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
174
click to vote
CIKM
2011
Springer
14 years 5 months ago
2011
Springer
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
148
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
158
click to vote
IPPS
2009
IEEE
16 years 8 days ago
2009
IEEE
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
173
click to vote
ISLPED
2006
ACM
15 years 11 months ago
2006
ACM
All existing methods for thermal-via allocation are based on a steady-state thermal analysis and may lead to excessive number of thermal vias. This paper develops an accurate and ...
164
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...