1871 search results - page 348 / 375 » The Ephemeral Pairing Problem |
WCNC
2008
IEEE
15 years 5 months ago
2008
IEEE
—Iterative K-best sphere detection (SD) and channel decoding is appealing, since it is capable of achieving a nearmaximum-a-posteriori (MAP) performance at a low complexity. Howe...
75
Voted
ICDM
2007
IEEE
15 years 5 months ago
2007
IEEE
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
EUROCAST
2007
Springer
15 years 5 months ago
2007
Springer
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
ICB
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In many applications, such as E-Passport and driver’s license, the enrollment of face templates is done using visible light (VIS) face images. Such images are normally ...