Sciweavers

475 search results - page 52 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
CSCLP
2006
Springer
13 years 11 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
MIR
2004
ACM
154views Multimedia» more  MIR 2004»
14 years 1 months ago
Fast and robust short video clip search using an index structure
In this paper, we present an index structure-based method to fast and robustly search short video clips in large video collections. First we temporally segment a given long video ...
Junsong Yuan, Ling-Yu Duan, Qi Tian, Changsheng Xu
MMS
2010
13 years 2 months ago
InstantLeap: an architecture for fast neighbor discovery in large-scale P2P VoD streaming
In large-scale peer-to-peer (P2P) Video-on-Demand (VoD) streaming applications, a fundamental challenge is to quickly locate new supplying peers whenever a VCR command is issued, ...
Xuanjia Qiu, Wei Huang, Chuan Wu, Francis C. M. La...
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 8 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
14 years 9 months ago
Distance Based Subspace Clustering with Flexible Dimension Partitioning
Traditional similarity or distance measurements usually become meaningless when the dimensions of the datasets increase, which has detrimental effects on clustering performance. I...
Guimei Liu, Jinyan Li, Kelvin Sim, Limsoon Wong