2693 search results - page 330 / 539 » On Computing Complex Navigation Functions |
160
click to vote
FOCS
2008
IEEE
16 years 29 days 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...
176
click to vote
CVPR
2007
IEEE
16 years 26 days ago
2007
IEEE
Image matting is the problem of determining for each pixel in an image whether it is foreground, background, or the mixing parameter, ”alpha”, for those pixels that are a mixt...
181
click to vote
RTSS
2007
IEEE
16 years 24 days ago
2007
IEEE
Many distributed real-time systems face the challenge of dynamically maximizing system utility and meeting stringent resource constraints in response to fluctuations in system wo...
156
click to vote
IPPS
2006
IEEE
16 years 16 days ago
2006
IEEE
The development of Field Programmable Gate Arrays (FPGAs) had tremendous improvements in the last few years. They were extended from simple logic circuits to complex Systems-on-Ch...
150
click to vote
FOCS
2005
IEEE
16 years 4 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...