336 search results - page 38 / 68 » Improved data structures for fully dynamic biconnectivity |
SAC
2005
ACM
15 years 5 months ago
2005
ACM
: Traditional spatial indexes like R-tree usually assume the database is not updated frequently. In applications like location-based services and sensor networks, this assumption i...
ESORICS
2009
Springer
16 years 12 days ago
2009
Springer
Abstract. As the number and scope of government regulations and rules mandating trustworthy retention of data keep growing, businesses today are facing a higher degree of regulatio...
CCGRID
2010
IEEE
14 years 10 months ago
2010
IEEE
—While computing speed continues increasing rapidly, data-access technology is lagging behind. Data-access delay, not the processor speed, becomes the leading performance bottlen...
101
click to vote
ISSTA
2010
ACM
15 years 1 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
102
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...