Sciweavers

933 search results - page 159 / 187
» Monotone Complexity of a Pair
Sort
View
WCNC
2008
IEEE
14 years 3 months ago
Three-Stage Serially Concatenated Codes and Iterative Center-Shifting K-Best Sphere Detection for SDM-OFDM: An EXIT Chart Aided
—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...
Li Wang, Lei Xu, Sheng Chen, Lajos Hanzo
AIED
2007
Springer
14 years 2 months ago
Assessing Learning in a Peer-Driven Tutoring System
In many intelligent tutoring systems, a detailed model of the task domain is constructed and used to provide students with assistance and direction. Reciprocal tutoring systems, h...
Ari Bader-Natal, Jordan B. Pollack
EUROCAST
2007
Springer
182views Hardware» more  EUROCAST 2007»
14 years 2 months ago
A k-NN Based Perception Scheme for Reinforcement Learning
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...
José Antonio Martin H., Javier de Lope Asia...
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 2 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
INFOCOM
2006
IEEE
14 years 2 months ago
Scalable Clustering of Internet Paths by Shared Congestion
— Internet paths sharing the same bottleneck can be identified using several shared congestion detection techniques. However, all of these techniques have been designed to detec...
Min Sik Kim, Taekhyun Kim, YongJune Shin, Simon S....