3466 search results - page 62 / 694 » Fast computation of special resultants |
80
Voted
SGP
2007
15 years 3 months ago
2007
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
124
Voted
ANCS
2011
ACM
14 years 19 days ago
2011
ACM
Peer-to-peer (P2P) applications distribute large files fast. That makes them popular on the Internet and has motivated their use on datacenter networks. On datacenter networks, h...
102
click to vote
ICCAD
2008
IEEE
15 years 9 months ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
123
Voted
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
Object localization and classification are important problems in computer vision.
However, in many applications, exhaustive search over all class labels and image
locations is co...
DAC
2005
ACM
16 years 1 months ago
2005
ACM
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...