3008 search results - page 565 / 602 » Independence in connected graphs |
179
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Data sparsity, scalability and prediction quality have been recognized as the three most crucial challenges that every collaborative filtering algorithm or recommender system conf...
152
click to vote
APPROX
2010
Springer
15 years 7 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
172
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
In this paper parallel universes are defined by their relation to multi-criteria optimization combined with an explicit or implicit link for the unambiguous identification of an ...
157
click to vote
ECEH
2007
15 years 7 months ago
2007
: Mobile devices are becoming ubiquitous in everyday’s life, their popularity and place independence are reasons for using these devices in different areas. One such area is elec...
185
click to vote
ESANN
2007
15 years 7 months ago
2007
Any order parameter quantifying the degree of organisation in a physical system can be studied in connection to source extraction algorithms. Independent component analysis (ICA) b...