Sciweavers

157 search results - page 4 / 32
» Randomized Algorithms for Minimum Distance Localization
Sort
View
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
12 years 9 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
ECCC
2011
204views ECommerce» more  ECCC 2011»
12 years 9 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 6 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
ICASSP
2010
IEEE
13 years 4 months ago
A partially collapsed Gibbs sampler for parameters with local constraints
We consider Bayesian detection/classification of discrete random parameters that are strongly dependent locally due to some deterministic local constraint. Based on the recently ...
Georg Kail, Jean-Yves Tourneret, Franz Hlawatsch, ...
ROBIO
2006
IEEE
148views Robotics» more  ROBIO 2006»
14 years 4 days ago
A Dynamic MDS-Based Localization Algorithm for Mobile Sensor Networks
Abstract— In this paper, we proposed a dynamic mobilityassisted MDS-based localization algorithms for sparse mobile sensor network. For sparse networks, the assumption of the exi...
Changhua Wu, Weihua Sheng, Wen-Zhan Song