Sciweavers

526 search results - page 61 / 106
» On the Number of Minimal Addition Chains
Sort
View
ICASSP
2010
IEEE
14 years 8 months ago
An alternative scanning strategy to detect faces
The sliding window approach is the most widely used technique to detect faces in an image. Usually a classifier is applied on a regular grid and to speed up the scanning, the gri...
Venkatesh Bala Subburaman, Sébastien Marcel
MICS
2010
137views more  MICS 2010»
14 years 8 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
BIBM
2010
IEEE
139views Bioinformatics» more  BIBM 2010»
14 years 7 months ago
Scalable, updatable predictive models for sequence data
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
Neeraj Koul, Ngot Bui, Vasant Honavar
GLVLSI
2011
IEEE
351views VLSI» more  GLVLSI 2011»
14 years 1 months ago
Design of low-power multiple constant multiplications using low-complexity minimum depth operations
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
Levent Aksoy, Eduardo Costa, Paulo F. Flores, Jos&...
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 3 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang