2661 search results - page 483 / 533 » Quantum Complexity Classes |
106
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
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...
115
click to vote
OSDI
2008
ACM
16 years 1 months ago
2008
ACM
Abstract ? Large enterprise networks consist of thousands of services and applications. The performance and reliability of any particular application may depend on multiple service...
191
click to vote
VLDB
2007
ACM
16 years 28 days ago
2007
ACM
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related ...
188
Voted
VLDB
2007
ACM
16 years 28 days ago
2007
ACM
As more sensitive data is captured in electronic form, security becomes more and more important. Data encryption is the main technique for achieving security. While in the past en...
182
Voted
SIGMOD
2008
ACM
16 years 26 days ago
2008
ACM
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electroni...