492 search results - page 5 / 99 » The number of possibilities for random dating |
126
click to vote
ENDM
2000
14 years 9 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
This paper presents an exploration algorithm which examines execution time and energy consumption of a given application, while considering a parameterized memory architecture. Th...
IJBC
2007
14 years 10 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
SP
1997
IEEE
15 years 1 months ago
1997
IEEE
Encrypted Key Exchange (EKE) [1, 2] allows two parties sharing a password to exchange authenticated information over an insecure network by using a combination of public and secre...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
In multiuser detection, the set of users active at any time may be unknown to the receiver. A two-step detection procedure, in which multiuser detection is preceded by active-user...