Sciweavers

4302 search results - page 372 / 861
» Index Pairs Algorithms
Sort
View
152
Voted
JCDL
2010
ACM
156views Education» more  JCDL 2010»
15 years 5 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
GEOINFORMATICA
2006
103views more  GEOINFORMATICA 2006»
15 years 5 months ago
Building and Querying a P2P Virtual World
Peer-to-Peer (P2P) systems are known to provide excellent scalability in a networked environment. One peer is introduced to the system by each participant. However current P2P app...
Egemen Tanin, Aaron Harwood, Hanan Samet, Deepa Na...
JEA
2008
120views more  JEA 2008»
15 years 5 months ago
Better external memory suffix array construction
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
Roman Dementiev, Juha Kärkkäinen, Jens M...
CSDA
2007
99views more  CSDA 2007»
15 years 5 months ago
CLUES: A non-parametric clustering method based on local shrinking
In this paper, we propose a novel non-parametric clustering method based on non-parametric local shrinking. Each data point is transformed in such a way that it moves a specific ...
Xiaogang Wang, Weiliang Qiu, Ruben H. Zamar
TCS
2008
15 years 5 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq