Sciweavers

176 search results - page 18 / 36
» Sorting and Selection with Random Costs
Sort
View
ICIP
2007
IEEE
14 years 2 months ago
Adaptive Cluster-Distance Bounding for Nearest Neighbor Search in Image Databases
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
Sharadh Ramaswamy, Kenneth Rose
DCC
2010
IEEE
13 years 5 months ago
Optimization of Overlapped Tiling for Efficient 3D Image Retrieval
Remote visualization of an arbitrary 2-D planar "cut" from a large volumetric dataset with random access has both gained importance and posed significant challenges over...
Zihong Fan, Antonio Ortega
ICWMC
2006
IEEE
14 years 1 months ago
A Coverage Analysis of Amplify-and-Forward Relaying Schemes in Outdoor Urban Environment
— The use of cellular systems enhanced by fixed relays has previously been proposed as a way to provide wide area coverage for high bit-rate at a reduced cost of the wireless ac...
Bogdan Timus
JCSS
2002
199views more  JCSS 2002»
13 years 7 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
AAAI
2010
13 years 9 months ago
Myopic Policies for Budgeted Optimization with Constrained Experiments
Motivated by a real-world problem, we study a novel budgeted optimization problem where the goal is to optimize an unknown function f(x) given a budget. In our setting, it is not ...
Javad Azimi, Xiaoli Fern, Alan Fern, Elizabeth Bur...