2638 search results - page 170 / 528 » Random Geometric Complexes |
167
click to vote
AAAI
2011
14 years 6 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
207
click to vote
TMC
2012
13 years 8 months ago
2012
—Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities hav...
192
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Recommender systems are an emerging technology that helps consumers find interesting products and useful resources. A recommender system makes personalized product suggestions by e...
191
click to vote
CHES
2005
Springer
16 years 2 hour ago
2005
Springer
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
157
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...