1289 search results - page 253 / 258 » Complexity of Counting the Optimal Solutions |
129
click to vote
VLDB
1998
ACM
15 years 8 months ago
1998
ACM
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
158
click to vote
EUROCRYPT
2008
Springer
15 years 5 months ago
2008
Springer
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to bits of communication wi...
125
click to vote
SIROCCO
2010
15 years 5 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
144
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Adaptive orthogonal frequency division multiple access (OFDMA) has recently been recognized as a promising technique for providing high spectral efficiency in future broadband wire...
163
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match- a feature where an ad of an advertiser can be mapped to a b...