2693 search results - page 385 / 539 » On Computing Complex Navigation Functions |
153
Voted
VLSID
2005
IEEE
16 years 7 months ago
2005
IEEE
Polynomial expressions are used to approximate a wide variety of functions commonly found in signal processing and computer graphics applications. Computing these polynomial expre...
160
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
197
Voted
DSN
2009
IEEE
16 years 1 months ago
2009
IEEE
Dynamic Information Flow Tracking (DIFT) is a promising security technique. With hardware support, DIFT prevents a wide range of attacks on vulnerable software with minimal perfor...
170
click to vote
FC
2009
Springer
16 years 1 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
183
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...