Sciweavers

263 search results - page 8 / 53
» Extracting Randomness Using Few Independent Sources
Sort
View
SIGPRO
2002
91views more  SIGPRO 2002»
13 years 7 months ago
Comparison of maximum entropy and minimal mutual information in a nonlinear setting
In blind source separation (BSS), two di erent separation techniques are mainly used: minimal mutual information (MMI), where minimization of the mutual output information yields ...
Fabian J. Theis, Christoph Bauer, Elmar Wolfgang L...
ICCAD
2009
IEEE
136views Hardware» more  ICCAD 2009»
13 years 5 months ago
A hierarchical floating random walk algorithm for fabric-aware 3D capacitance extraction
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...
Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Dani...
EOR
2011
172views more  EOR 2011»
13 years 2 months ago
Efficiency measurement using independent component analysis and data envelopment analysis
Efficiency measurement is an important issue for any firm or organization. Efficiency measurement allows organizations to compare their performance with their competitors’ and t...
Ling-Jing Kao, Chi-Jie Lu, Chih-Chou Chiu
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 8 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
WEBDB
1998
Springer
96views Database» more  WEBDB 1998»
13 years 11 months ago
Extracting Patterns and Relations from the World Wide Web
The World Wide Web is a vast resource for information. At the same time it is extremely distributed. A particular type of data such as restaurant lists maybe scattered across thous...
Sergey Brin