11212 search results - page 2242 / 2243 » Semi-persistent Data Structures |
STOC
2010
ACM
14 years 26 days ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
CHI
1999
ACM
14 years 26 days ago
1999
ACM
not abstract asymmetry: different sides looks different clumps different from ”data objects” need grid structure, alignment [Design Guidelines for Landmarks to Support Navigati...
HICSS
1999
IEEE
14 years 26 days ago
1999
IEEE
The Technology Acceptance Model (TAM) represents an important theoretical contribution toward understanding IS usage and IS acceptance behaviors [6, 19]. However, as noted by seve...
ICCV
1999
IEEE
14 years 26 days ago
1999
IEEE
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...