14 search results - page 2 / 3 » Fast computing reachability labelings for large graphs with ... |
JCP
2008
13 years 5 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
IJCAI
2003
13 years 6 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
EUROSSC
2007
Springer
13 years 11 months ago
2007
Springer
This paper addresses the design of a large area, high resolution, networked pressure sensing floor with primary application in movement-based human-computer interaction (M-HCI). T...
BMCBI
2010
13 years 2 months ago
2010
Background: To exploit the flood of data from advances in high throughput imaging of optically sectioned nuclei, image analysis methods need to correctly detect thousands of nucle...
CGF
2006
13 years 5 months ago
2006
We describe a compressed multiresolution representation for supporting interactive rendering of very large planar and spherical terrain surfaces. The technique, called Compressed ...