336 search results - page 21 / 68 » Improved data structures for fully dynamic biconnectivity |
ESA
2004
Springer
15 years 5 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
110
click to vote
SODA
2004
ACM
15 years 1 months ago
2004
ACM
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
99
Voted
AAAI
2006
15 years 1 months ago
2006
The ability to update the structure of a Bayesian network when new data becomes available is crucial for building adaptive systems. Recent work by Sang, Beame, and Kautz (AAAI 200...
104
click to vote
ICCD
2006
IEEE
15 years 8 months ago
2006
IEEE
Pointer bugs associated with dynamically-allocated objects resulting in out-of-bounds memory access are an important class of software bugs. Because such bugs cannot be detected e...
100
click to vote
ICANN
2010
Springer
15 years 26 days ago
2010
Springer
Abstract. We investigate the extent to which eye movements in natural dynamic scenes can be predicted with a simple model of bottom-up saliency, which learns on different visual re...