Sciweavers

941 search results - page 24 / 189
» Efficient Testing of Large Graphs
Sort
View
ISCSCT
2008
IEEE
15 years 4 months ago
Large Scale Scenes Reconstruction from Multiple Views
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...
Limin Shi, Feng Zhang, Zhenhui Xu, Zhanyi Hu
EDBT
2008
ACM
160views Database» more  EDBT 2008»
14 years 11 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu
80
Voted
ICRA
1999
IEEE
138views Robotics» more  ICRA 1999»
15 years 1 months ago
Efficient Topological Exploration
We consider the robot exploration of a planar graphlike world. The robot's goal is to build a complete map of its environment. The environment is modeled as an arbitrary undi...
Ioannis M. Rekleitis, Vida Dujmovic, Gregory Dudek
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
14 years 11 months ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi
TCAD
2002
73views more  TCAD 2002»
14 years 9 months ago
System-on-a-chip test scheduling with precedence relationships, preemption, and power constraints
Test scheduling is an important problem in system-on-a-chip (SOC) test automation. Efficient test schedules minimize the overall system test application time, avoid test resource c...
Vikram Iyengar, Krishnendu Chakrabarty