Sciweavers

1974 search results - page 69 / 395
» On Unbiased Linear Approximations
Sort
View
94
Voted
CVPR
2007
IEEE
16 years 2 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
130
Voted
DAC
2006
ACM
16 years 1 months ago
Optimization of area under a delay constraint in digital filter synthesis using SAT-based integer linear programming
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...
Eduardo A. C. da Costa, José Monteiro, Leve...
109
Voted
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
16 years 28 days ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
92
Voted
VLSID
2008
IEEE
83views VLSI» more  VLSID 2008»
16 years 1 months ago
Efficient Linear Macromodeling via Discrete-Time Time-Domain Vector Fitting
We present a discrete-time time-domain vector fitting algorithm, called TD-VFz, for rational function macromodeling of port-to-port responses with discrete time-sampled data. The ...
Chi-Un Lei, Ngai Wong
79
Voted
ICALP
2010
Springer
15 years 5 months ago
On the k-Independence Required by Linear Probing and Minwise Independence
We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC’07]. For (1 + ε)-approxima...
Mihai Patrascu, Mikkel Thorup