973 search results - page 13 / 195 » New Bounds on Crossing Numbers |
KDID
2004
13 years 8 months ago
2004
We are designing new data mining techniques on boolean contexts to identify a priori interesting bi-sets (i.e., sets of objects or transactions associated to sets of attributes or ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—OFDM systems are the major cellular platforms for supporting ubiquitous high performance mobile applications. However, there remain a number of research challenges to be tackled...
SIAMNUM
2010
13 years 2 months ago
2010
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
EUROCRYPT
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
IJCAI
2007
13 years 8 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...