Sciweavers

5153 search results - page 9 / 1031
» Introduction to Randomized Algorithms
Sort
View
DEXA
2008
Springer
155views Database» more  DEXA 2008»
14 years 11 months ago
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
Tomás Skopal, Jakub Lokoc
IJCAI
2007
14 years 11 months ago
Robust Object Tracking with a Case-Base Updating Strategy
The paper describes a simple but effective framework for visual object tracking in video sequences. The main contribution of this work lies in the introduction of a case-based rea...
Wenhui Liao, Yan Tong, Zhiwei Zhu, Qiang Ji
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
13 years 1 days ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun
MCU
2004
95views Hardware» more  MCU 2004»
14 years 11 months ago
Algorithmic Randomness, Quantum Physics, and Incompleteness
Abstract. Is randomness in quantum mechanics "algorithmically random"? Is there any relation between Heisenberg's uncertainty relation and G
Cristian Calude
RSA
2008
78views more  RSA 2008»
14 years 9 months ago
How many random edges make a dense hypergraph non-2-colorable?
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
Benny Sudakov, Jan Vondrák