1469 search results - page 260 / 294 » Approximate polynomial decomposition |
DATE
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
118
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
COCOA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
106
click to vote
COCO
2001
Springer
15 years 4 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
EMMCVPR
2001
Springer
15 years 4 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...