1554 search results - page 229 / 311 » Parameterized Complexity and Approximation Algorithms |
118
Voted
ACL
2011
14 years 6 months ago
2011
This paper presents an attempt at building a large scale distributed composite language model that simultaneously accounts for local word lexical information, mid-range sentence s...
135
Voted
ICCV
1999
IEEE
16 years 4 months ago
1999
IEEE
The human figure exhibits complex and rich dynamic behavior that is both nonlinear and time-varying. However, most work on tracking and synthesizing figure motion has employed eit...
113
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
119
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
135
Voted
COLT
2007
Springer
15 years 9 months ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...