Sciweavers

233 search results - page 5 / 47
» Semantical Counting Circuits
Sort
View
ISLPED
2006
ACM
140views Hardware» more  ISLPED 2006»
14 years 1 months ago
L-CBF: a low-power, fast counting bloom filter architecture
—An increasing number of architectural techniques rely on hardware counting bloom filters (CBFs) to improve upon the enegy, delay and complexity of various processor structures. ...
Elham Safi, Andreas Moshovos, Andreas G. Veneris
CJTCS
1999
133views more  CJTCS 1999»
13 years 7 months ago
The Permanent Requires Large Uniform Threshold Circuits
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
Eric Allender
NIPS
2007
13 years 8 months ago
Sparse Overcomplete Latent Variable Decomposition of Counts Data
An important problem in many fields is the analysis of counts data to extract meaningful latent components. Methods like Probabilistic Latent Semantic Analysis (PLSA) and Latent ...
Madhusudana V. S. Shashanka, Bhiksha Raj, Paris Sm...
SPIRE
2005
Springer
14 years 27 days ago
Counting Lumps in Word Space: Density as a Measure of Corpus Homogeneity
This paper introduces a measure of corpus homogeneity that indicates the amount of topical dispersion in a corpus. The measure is based on the density of neighborhoods in semantic ...
Magnus Sahlgren, Jussi Karlgren
DATE
2008
IEEE
103views Hardware» more  DATE 2008»
14 years 1 months ago
Novel Pin Assignment Algorithms for Components with Very High Pin Counts
The wiring effort and thus, the routability of electronic designs such as printed circuit boards, multi chip modules and single chip modules largely depends on the assignment of s...
Tilo Meister, Jens Lienig, Gisbert Thomke