Sciweavers

1763 search results - page 53 / 353
» Dependent random choice
Sort
View
IJON
2006
96views more  IJON 2006»
13 years 9 months ago
Quasi-optimal EASI algorithm based on the Score Function Difference (SFD)
Equivariant Adaptive Separation via Independence (EASI) is one of the most successful algorithms for Blind Source Separation (BSS). However, the user has to choose nonlinearities,...
Samareh Samadi, Massoud Babaie-Zadeh, Christian Ju...
NIPS
2003
13 years 10 months ago
From Algorithmic to Subjective Randomness
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
Thomas L. Griffiths, Joshua B. Tenenbaum
INFOCOM
2009
IEEE
14 years 3 months ago
Toward Optimal Utilization of Shared Random Access Channels
—We consider a multipacket reception channel shared by several communication applications. This is the case, for example, in a single radio mesh network where neighboring cells u...
Joseph Naor, Danny Raz, Gabriel Scalosub
CIKM
2008
Springer
13 years 11 months ago
Academic conference homepage understanding using constrained hierarchical conditional random fields
We address the problem of academic conference homepage understanding for the Semantic Web. This problem consists of three labeling tasks - labeling conference function pages, func...
Xin Xin, Juanzi Li, Jie Tang, Qiong Luo
CC
2008
Springer
131views System Software» more  CC 2008»
13 years 9 months ago
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
Marius Zimand