Sciweavers

2889 search results - page 304 / 578
» Querying Structured Hyperdocuments
Sort
View
MM
2005
ACM
87views Multimedia» more  MM 2005»
15 years 11 months ago
Toward emergent representations for video
Advanced systems for finding, using, sharing, and remixing video require high-level representations of video content. A number of researchers have taken top-down, analytic approac...
Ryan Shaw, Marc Davis
DEBS
2007
ACM
15 years 8 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
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...
CPM
2010
Springer
175views Combinatorics» more  CPM 2010»
15 years 11 months ago
Compression, Indexing, and Retrieval for Massive String Data
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
ICDE
2004
IEEE
105views Database» more  ICDE 2004»
16 years 7 months ago
SPINE: Putting Backbone into String Indexing
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
Naresh Neelapala, Romil Mittal, Jayant R. Haritsa