2452 search results - page 197 / 491 » The Case for Precision Sharing |
169
click to vote
IJNSEC
2008
15 years 6 months ago
2008
In1985, Shmuley proposed a theorem about intractability of Composite Diffie-Hellman. The theorem of Shmuley may be paraphrased as saying that if there exist a probabilistic polyno...
138
click to vote
MSS
2008
IEEE
15 years 6 months ago
2008
IEEE
It is shown that preferences can be constructed from observed choice behavior in a way that is robust to indifferent selection (i.e., the agent is indifferent between two alternat...
200
click to vote
NETWORKS
2008
15 years 6 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
161
click to vote
ORL
2008
15 years 6 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
203
click to vote
TCS
2008
15 years 6 months ago
2008
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...