Sciweavers

223 search results - page 2 / 45
» Generalized Descriptor Compression for Storage and Matching
Sort
View
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 4 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
CVPR
2007
IEEE
15 years 11 months ago
Topology matching for 3D video compression
This paper presents a new technique to reduce the storage cost of high quality 3D video. In 3D video [12], a sequence of 3D objects represents scenes in motion. Every frame is com...
Tony Tung, Francis Schmitt, Takashi Matsuyama
JCDL
2010
ACM
156views Education» more  JCDL 2010»
14 years 9 months ago
Interactively browsing movies in terms of action, foreshadowing and resolution
We describe a novel video player that uses Temporal Semantic Compression (TSC) to present a compressed summary of a movie. Compression is based on tempo which is derived from film...
Stewart Greenhill, Brett Adams, Svetha Venkatesh
CIKM
2006
Springer
15 years 1 months ago
Matching and evaluation of disjunctive predicates for data stream sharing
New optimization techniques, e. g., in data stream management systems (DSMSs), make the treatment of disjunctive predicates a necessity. In this paper, we introduce and compare me...
Richard Kuntschke, Alfons Kemper
SIGMOD
2009
ACM
111views Database» more  SIGMOD 2009»
15 years 9 months ago
Language-model-based ranking in entity-relation graphs
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
Shady Elbassuoni, Maya Ramanath, Gerhard Weikum