806 search results - page 94 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
120
click to vote
CF
2009
ACM
15 years 8 months ago
2009
ACM
Hybrid architectures combining the strengths of generalpurpose processors with application-specific hardware accelerators can lead to a significant performance improvement. Our ...
EDBT
2010
ACM
15 years 8 months ago
2010
ACM
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...
104
click to vote
STOC
2002
ACM
16 years 1 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
108
click to vote
ISMB
1997
15 years 2 months ago
1997
We are building a knowledge base (KB) of published structural data on the 30s ribosomal subunit in prokaryotes. Our KB is distinguished by a standardized representation of biologi...
127
click to vote
TKDE
2010
14 years 11 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...