Sciweavers

1068 search results - page 47 / 214
» On Space Bounded Server Algorithms
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
A fast nearest neighbor search algorithm by nonlinear embedding
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn
ICASSP
2008
IEEE
14 years 2 months ago
Cramer-Rao lower bound on doppler frequency of coherent pulse trains
This paper derives the Cramer-Rao lower bound (CRLB) on estimates of the frequency of a coherent pulse-train passively intercepted at a moving antenna. Such estimates are used to ...
J. Andrew Johnson, Mark L. Fowler
EDBT
2009
ACM
119views Database» more  EDBT 2009»
13 years 11 months ago
Unrestricted wavelet synopses under maximum error bound
Constructing Haar wavelet synopses under a given approximation error has many real world applications. In this paper, we take a novel approach towards constructing unrestricted Ha...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 27 days ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
CVPR
2009
IEEE
15 years 2 months ago
Efficient Scale Space Auto-Context for Image Segmentation and Labeling
The Conditional Random Fields (CRF) model, using patch-based classification bound with context information, has recently been widely adopted for image segmentation/ labeling. In...
Jiayan Jiang (UCLA), Zhuowen Tu (UCLA)