Sciweavers

750 search results - page 120 / 150
» Reconstruction for Models on Random Graphs
Sort
View
ICDE
2008
IEEE
168views Database» more  ICDE 2008»
15 years 6 months ago
Index Design for Dynamic Personalized PageRank
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
Amit Pathak, Soumen Chakrabarti, Manish S. Gupta
SI3D
2003
ACM
15 years 5 months ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
STOC
1998
ACM
125views Algorithms» more  STOC 1998»
15 years 4 months ago
Spot-Checkers
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
Funda Ergün, Sampath Kannan, Ravi Kumar, Roni...
ICST
2010
IEEE
14 years 10 months ago
Repairing GUI Test Suites Using a Genetic Algorithm
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
Si Huang, Myra B. Cohen, Atif M. Memon
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
14 years 3 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...