Sciweavers

1201 search results - page 183 / 241
» Linear Probing and Graphs
Sort
View
98
Voted
ICIP
2009
IEEE
16 years 1 months ago
Scale-robust Feature Extraction For Face Recognition
In video surveillance, the sizes of face images are very small. However, few works have been done to investigate scalerobust face recognition. Our experiments on appearancebased m...
95
Voted
DAC
2004
ACM
16 years 1 months ago
Multiple constant multiplication by time-multiplexed mapping of addition chains
An important primitive in the hardware implementations of linear DSP transforms is a circuit that can multiply an input value by one of several different preset constants. We prop...
James C. Hoe, Markus Püschel, Peter Tummeltsh...
ICML
2006
IEEE
16 years 1 months ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan
105
Voted
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 27 days ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
85
Voted
ICCAD
2007
IEEE
161views Hardware» more  ICCAD 2007»
15 years 9 months ago
Clustering based pruning for statistical criticality computation under process variations
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
Hushrav Mogal, Haifeng Qian, Sachin S. Sapatnekar,...