2778 search results - page 185 / 556 » Limit complexities revisited |
176
click to vote
TCAD
2010
15 years 1 months ago
2010
The last decade has witnessed the emergence of the application-specific instruction-set processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user ...
189
click to vote
TSP
2010
15 years 1 months ago
2010
Abstract--Multichannel fast QR decomposition RLS (MCFQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The main limitation is...
175
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
196
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
204
click to vote
EVOW
2010
Springer
16 years 1 months ago
2010
Springer
DEODHAR, SUSHAMNA DEODHAR. Using Grammatical Evolution Decision Trees for Detecting Gene-Gene Interactions in Genetic Epidemiology. (Under the direction of Dr. Alison Motsinger-Re...