5100 search results - page 286 / 1020 » The Linear Complexity of a Graph |
125
click to vote
JAIR
2010
15 years 2 months ago
2010
Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than...
133
Voted
ASPDAC
2010
ACM
15 years 2 months ago
2010
ACM
To cope with an increasing complexity when analyzing analog mismatch in sub-90nm designs, this paper presents a fast non-MonteCarlo method to calculate mismatch in time domain. Th...
158
click to vote
TCS
2011
14 years 11 months ago
2011
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
125
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper proposes a novel algorithm for decoding real-field codes over erroneous channels, where the encoded message is corrupted by sparse errors, i.e., impulsive noise. The m...
126
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...