Sciweavers

33 search results - page 3 / 7
» An Efficient Query Structure for Mesh Refinement
Sort
View
CCCG
2010
13 years 6 months ago
I/O efficient path traversal in well-shaped tetrahedral meshes
We present a data structure which represents a wellshaped convex tetrahedral mesh, M, in linear space such that path traversals visiting a sequence of K tetrahedra require O (K/ l...
Craig Dillabaugh
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
13 years 3 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
VLDB
2001
ACM
153views Database» more  VLDB 2001»
13 years 9 months ago
A Fast Index for Semistructured Data
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...
Brian F. Cooper, Neal Sample, Michael J. Franklin,...
WEBDB
1998
Springer
106views Database» more  WEBDB 1998»
13 years 9 months ago
Interactive Query and Search in Semistructured Databases
Semistructured graph-based databases have been proposed as well-suited stores for World-Wide Web data. Yet so far, languages for querying such data are too complex for casual Web ...
Roy Goldman, Jennifer Widom
ICDE
2009
IEEE
285views Database» more  ICDE 2009»
14 years 7 months ago
Design and Evaluation of the iMed Intelligent Medical Search Engine
-- Searching for medical information on the Web is popular and important. However, medical search has its own unique requirements that are poorly handled by existing medical Web se...
Gang Luo