Sciweavers

51986 search results - page 10291 / 10398
» Are There New Models of Computation
Sort
View
222
Voted
POPL
2006
ACM
16 years 29 days ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
STOC
2004
ACM
152views Algorithms» more  STOC 2004»
16 years 29 days ago
Exponential separation of quantum and classical one-way communication complexity
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
106
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 29 days ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
112
Voted
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
16 years 29 days ago
The price of anarchy is independent of the network topology
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
Tim Roughgarden
VLDB
2008
ACM
170views Database» more  VLDB 2008»
16 years 27 days ago
A layered framework supporting personal information integration and application design for the semantic desktop
With the development of inexpensive storage devices, space usage is no longer a bottleneck for computer users. However, the increasingly large amount of personal information poses ...
Isabel F. Cruz, Huiyong Xiao
« Prev « First page 10291 / 10398 Last » Next »