Sciweavers

146 search results - page 16 / 30
» External Matching in UDDI
Sort
View
ICDE
2010
IEEE
180views Database» more  ICDE 2010»
13 years 7 months ago
Adaptive indexing for relational keys
: © Adaptive indexing for relational keys Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-23 databases, indexes, storage systems, B-trees, adaptive merging, database cracking A...
Goetz Graefe, Harumi A. Kuno
SMI
2008
IEEE
150views Image Analysis» more  SMI 2008»
14 years 2 months ago
SHREC'08 entry: Multi-view 3D retrieval using multi-scale contour representation
We describe in this paper a method for 3D shape indexing and retrieval that we apply on three data collections of the SHREC SHape Retrieval Contest 2008: Stability on watertight, ...
Thibault Napoleon, Tomasz Adamek, Francis Schmitt,...
FCCM
2003
IEEE
96views VLSI» more  FCCM 2003»
14 years 28 days ago
Data Search and Reorganization Using FPGAs: Application to Spatial Pointer-based Data Structures
FPGAs have appealing features such as customizable internal and external bandwidth and the ability to exploit vast amounts of fine-grain parallelism. In this paper we explore the ...
Pedro C. Diniz, Joonseok Park
LREC
2010
162views Education» more  LREC 2010»
13 years 9 months ago
Text Cluster Trimming for Better Descriptions and Improved Quality
Text clustering is potentially very useful for exploration of text sets that are too large to study manually. The success of such a tool depends on whether the results can be expl...
Magnus Rosell
SODA
2008
ACM
143views Algorithms» more  SODA 2008»
13 years 9 months ago
Dynamic optimality for skip lists and B-trees
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
Prosenjit Bose, Karim Douïeb, Stefan Langerma...