Sciweavers

464 search results - page 67 / 93
» On Support of Ordering in Multidimensional Data Structures
Sort
View
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
15 years 6 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
SEMWEB
2010
Springer
14 years 11 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood
ICMCS
2005
IEEE
106views Multimedia» more  ICMCS 2005»
15 years 7 months ago
Retrieval of 3D objects using curvature correlograms
Along with images and videos, 3D models have raised a certain interest for a number of reasons, including advancements in 3D hardware and software technologies, their ever decreas...
Gianni Antini, Stefano Berretti, Alberto Del Bimbo...
POPL
1993
ACM
15 years 5 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
CLUSTER
2005
IEEE
15 years 7 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman