3974 search results - page 227 / 795 » Metric Functional Dependencies |
127
click to vote
ENTCS
2007
15 years 5 months ago
2007
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
188
click to vote
GLOBECOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Cognitive radio (CR) emerges as a key technology to enhance spectrum efficiency and thus creates opportunistic transmissions over links. Supporting the routing function on top of n...
121
click to vote
WCNC
2008
IEEE
16 years 9 days ago
2008
IEEE
— In this paper we demonstrate that our ability to match the EXtrinsic Information Transfer (EXIT) function of an Irregular Variable Length Code (IrVLC) to that of a seriallyconc...
159
click to vote
SIROCCO
2008
15 years 7 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
157
click to vote
AAAI
2000
15 years 7 months ago
2000
The complexity of numerical domain partitioning depends on the number of potential cut points. In multiway partitioning this dependency is often quadratic, even exponential. There...