Sciweavers

11214 search results - page 254 / 2243
» Just-in-time data structures
Sort
View
149
Voted
CG
2011
Springer
14 years 4 months ago
IA*: An adjacency-based representation for non-manifold simplicial shapes in arbitrary dimensions
We propose a compact, dimension-independent data structure for manifold, non-manifold and non-regular simplicial complexes, that we call the Generalized Indexed Data structure wit...
David Canino, Leila De Floriani, Kenneth Weiss
103
Voted
CC
2005
Springer
120views System Software» more  CC 2005»
15 years 6 months ago
Data Slicing: Separating the Heap into Independent Regions
In this paper, we present a formal description of data slicing, which is a type-directed program transformation technique that separates a program’s heap into several independent...
Jeremy Condit, George C. Necula
139
Voted
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 3 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
ADC
2003
Springer
173views Database» more  ADC 2003»
15 years 6 months ago
Cooperative Query Answering for Semistructured Data
Semistructured data, in particular XML, has emerged as one of the primary means for information exchange and content management. The power of XML allows authors to structure a doc...
Michael Barg, Raymond K. Wong
SIGMOD
2009
ACM
219views Database» more  SIGMOD 2009»
16 years 1 months ago
Hermes: a travel through semantics on the data web
The Web as a global information space is developing from a Web of documents to a Web of data. This development opens new ways for addressing complex information needs. Search is n...
Haofen Wang, Thomas Penin, Kaifeng Xu, Junquan Che...