Sciweavers

11211 search results - page 314 / 2243
» Rank-Sensitive Data Structures
Sort
View
WWW
2006
ACM
16 years 7 months ago
Symmetrically exploiting XML
Path expressions are the principal means of locating data in a hierarchical model. But path expressions are brittle because they often depend on the structure of data and break if...
Shuohao Zhang, Curtis E. Dyreson
TOG
2002
114views more  TOG 2002»
15 years 6 months ago
Shader-driven compilation of rendering assets
Rendering performance of consumer graphics hardware benefits from pre-processing geometric data into a form targeted to the underlying API and hardware. The various elements of ge...
Paul Lalonde, Eric Schenk
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 9 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
IMR
2003
Springer
15 years 11 months ago
Compact Representations of Simplicial Meshes in Two and Three Dimensions
We describe data structures for representing simplicial meshes compactly while supporting online queries and updates efficiently. Our data structure requires about a factor of fi...
Daniel K. Blandford, Guy E. Blelloch, David E. Car...
TACAS
2007
Springer
74views Algorithms» more  TACAS 2007»
16 years 21 days ago
Shape Analysis by Graph Decomposition
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
Roman Manevich, Josh Berdine, Byron Cook, G. Ramal...